Question

Equivalence of Position-Based Turing Machine Model to Standard Model

score 19 · Answer 1 · 2023-04-19 20:24:46

19

Views

Equivalence of Position-Based Turing Machine Model to Standard Model

Published on 19 Apr 2023 - 20:24

score 40 · Answer 2 · 2023-04-21 20:35:14

40

Views

Convex Optimisation: Effectively Computing the Minimum

Published on 21 Apr 2023 - 20:35

score 77 · Answer 3 · 2023-05-06 17:46:23

77

Views

Function that can be computed by two distinct Turing machines

Published on 06 May 2023 - 17:46

score 90 · Answer 4 · 2026-03-22 15:34:10

90

Views

Is the following language is regular, context free, and/or decidable?

Published on 22 Mar 2026 - 15:34

score 84 · Answer 5 · 2026-03-26 18:59:50

84

Views

Is the sublanguage immune from Gödel theorem

Published on 26 Mar 2026 - 18:59

score 170 · Answer 6 · 2026-03-26 18:58:54

170

Views

Prove the Gödel theorem using the Busy Beaver function

Published on 26 Mar 2026 - 18:58

score 66 · Answer 7 · 2026-03-26 19:05:18

66

Views

Gödel's incompleteness theorems for soundness or semantic consistency

Published on 26 Mar 2026 - 19:05

score 36 · Answer 8 · 2026-03-26 19:05:48

36

Views

Gödel's first incompleteness theorem from halting problem using soundness. Is it possible to use semantic consistency?

Published on 26 Mar 2026 - 19:05

score 48 · Answer 9 · 2023-05-18 23:30:52

48

Views

Computable Enumerability Definition Confusion

Published on 18 May 2023 - 23:30

score 60 · Answer 10 · 2023-05-19 18:52:46

60

Views

Simulating a Turing machine by multiple Turing machines with fewer states

Published on 19 May 2023 - 18:52

score 102 · Answer 11 · 2023-05-21 12:14:11

102

Views

What does B. V. Bowden mean by unearned umlaut and Teutonic in his book, Faster than Thought?

Published on 21 May 2023 - 12:14

score 94 · Answer 12 · 2023-05-25 13:51:40

94

Views

Transitivity of Turing reduction

Published on 25 May 2023 - 13:51

score 1.1k · Answer 13 · 2023-05-27 23:19:52

1.1k

Views

Prove that if L is a recursive language, then its complement Ls is also recursive

Published on 27 May 2023 - 23:19

score 115 · Answer 14 · 2026-03-26 06:25:30

115

Views

Prove projection of a computable function is computable without using Church-Turing Thesis

Published on 26 Mar 2026 - 6:25

score 1.1k · Answer 15 · 2023-06-09 04:01:51

1.1k

Views

Does the set of all programs form a group that acts on machine state (essentially, i.e. with a few exceptions)?

Published on 09 Jun 2023 - 4:01

List Question

Equivalence of Position-Based Turing Machine Model to Standard Model

Convex Optimisation: Effectively Computing the Minimum

Function that can be computed by two distinct Turing machines

Is the following language is regular, context free, and/or decidable?

Is the sublanguage immune from Gödel theorem

Prove the Gödel theorem using the Busy Beaver function

Gödel's incompleteness theorems for soundness or semantic consistency

Gödel's first incompleteness theorem from halting problem using soundness. Is it possible to use semantic consistency?

Computable Enumerability Definition Confusion

Simulating a Turing machine by multiple Turing machines with fewer states

What does B. V. Bowden mean by unearned umlaut and Teutonic in his book, Faster than Thought?

Transitivity of Turing reduction

Prove that if L is a recursive language, then its complement Ls is also recursive

Prove projection of a computable function is computable without using Church-Turing Thesis

Does the set of all programs form a group that acts on machine state (essentially, i.e. with a few exceptions)?

Trending Questions

Popular # Hahtags

Popular Questions