Question

Understanding Unary PCP Reduction to a Matching Problem (UPCP)

score 20 · Answer 1 · 2024-03-27T12:50:37.657000

20

Views

Understanding Unary PCP Reduction to a Matching Problem (UPCP)

Published on 27 March 2024 at 12:50

score 122 · Answer 2 · 2023-12-15T10:46:34.163000

122

Views

Build a Turing Machine that counts a's and b's

Published on 15 December 2023 at 10:46

score 59 · Answer 3 · 2023-07-25T22:03:27.550000

59

Views

Language for Turing Machine

Published on 25 July 2023 at 22:03

score 91 · Answer 4 · 2023-07-05T08:20:59.843000

91

Views

Unable to export Chains class from Julia's Turing library

Published on 05 July 2023 at 08:20

score 105 · Answer 5 · 2023-07-03T08:23:57.480000

105

Views

Complicated, long equations in MCMC [Julia, Turing.jl]

Published on 03 July 2023 at 08:23

score 85 · Answer 6 · 2023-06-24T02:48:32.983000

85

Views

Turing Pattern Formation

Published on 24 June 2023 at 02:48

score 72 · Answer 7 · 2023-06-11T18:03:10.350000

72

Views

Is there a way to prove that the intersection of a decidable language and a recognizable language is also recognizable?

Published on 11 June 2023 at 18:03

score 45 · Answer 8 · 2023-05-21T19:41:35.210000

45

Views

binary search with JFLAP turing machine

Published on 21 May 2023 at 19:41

score 61 · Answer 9 · 2023-05-17T14:53:24.450000

61

Views

python - 3 Turing Machine script, getting errors on an undefined variable, even though I assigned it

Published on 17 May 2023 at 14:53

score 109 · Answer 10 · 2023-04-17T06:41:27.587000

109

Views

Prove that the following problem is undecidable by a reduction from the halting problem:

Published on 17 April 2023 at 06:41

score 169 · Answer 11 · 2023-04-09T22:38:01.623000

169

Views

Construct a Turing Machine that halts on an unbroken string of 1s

Published on 09 April 2023 at 22:38

score 65 · Answer 12 · 2023-02-17T22:25:33.460000

65

Views

Jump to a specific vector place if a condition is met and start reading it from there

Published on 17 February 2023 at 22:25

score 1k · Answer 13 · 2023-01-12T07:41:56.610000

1k

Views

Binary to unary turing machine

Published on 12 January 2023 at 07:41

score 275 · Answer 14 · 2022-12-18T23:41:13.317000

275

Views

How to generate an Unrestricted grammar if a language defination is given

Published on 18 December 2022 at 23:41

score 162 · Answer 15 · 2022-12-13T00:27:40.353000

162

Views

Can we assure a strictly decreasing function is computable?

Published on 13 December 2022 at 00:27

score 136 · Answer 16 · 2022-12-12T09:06:34.440000

136

Views

Why is this Turing Machine not a decider?

Published on 12 December 2022 at 09:06

score 88 · Answer 17 · 2022-12-05T13:07:33.470000

88

Views

Are there any functions that are computable but not curriable?

Published on 05 December 2022 at 13:07

score 63 · Answer 18 · 2022-11-11T16:57:03.050000

63

Views

Input string: Exception in thread "main" java.util.NoSuchElementException: No line found at java.base/java.util.Scanner.nextLine(Scanner.java:1651)

Published on 11 November 2022 at 16:57

score 411 · Answer 19 · 2022-11-02T03:55:24.720000

411

Views

Why do we define equivalent turing machines as two turing machines with the same accepted languages?

Published on 02 November 2022 at 03:55

score 234 · Answer 20 · 2022-10-01T21:33:55.660000

234

Views

What is the quickest algorithm to merge input symbols and remove blanks in a turing machine

Published on 01 October 2022 at 21:33

List Question

Understanding Unary PCP Reduction to a Matching Problem (UPCP)

Build a Turing Machine that counts a's and b's

Language for Turing Machine

Unable to export Chains class from Julia's Turing library

Complicated, long equations in MCMC [Julia, Turing.jl]

Turing Pattern Formation

Is there a way to prove that the intersection of a decidable language and a recognizable language is also recognizable?

binary search with JFLAP turing machine

python - 3 Turing Machine script, getting errors on an undefined variable, even though I assigned it

Prove that the following problem is undecidable by a reduction from the halting problem:

Construct a Turing Machine that halts on an unbroken string of 1s

Jump to a specific vector place if a condition is met and start reading it from there

Binary to unary turing machine

How to generate an Unrestricted grammar if a language defination is given

Can we assure a strictly decreasing function is computable?

Why is this Turing Machine not a decider?

Are there any functions that are computable but not curriable?

Input string: Exception in thread "main" java.util.NoSuchElementException: No line found at java.base/java.util.Scanner.nextLine(Scanner.java:1651)

Why do we define equivalent turing machines as two turing machines with the same accepted languages?

What is the quickest algorithm to merge input symbols and remove blanks in a turing machine

Trending Questions

Popular # Hahtags

Popular Questions