Question

Why does a Turing machine take $n^k$ steps for computing an input?

score 353 · Answer 1 · 2018-12-17 05:06:03

353

Views

Why does a Turing machine take $n^k$ steps for computing an input?

Published on 17 Dec 2018 - 5:06

score 260 · Answer 2 · 2026-03-25 06:19:18

260

Views

Ultratasks in the ITTM Model

Published on 25 Mar 2026 - 6:19

score 1k · Answer 3 · 2018-12-22 10:08:50

1k

Views

What exactly does it mean for an Infinite Time Turing Machine to reach stage $\omega$ (and limit ordinal stage)?

Published on 22 Dec 2018 - 10:08

score 5.1k · Answer 4 · 2018-12-26 21:52:19

5.1k

Views

Exactly when and why can a Turing-machine not solve the halting problem?

Published on 26 Dec 2018 - 21:52

score 205 · Answer 5 · 2018-12-28 06:44:37

205

Views

What is the source of formal descriptions for large uncomputable ordinals clockable by Infinite Time Turing Machines?

Published on 28 Dec 2018 - 6:44

score 770 · Answer 6 · 2018-12-30 17:51:43

770

Views

Turing machine with read only part and finite tape

Published on 30 Dec 2018 - 17:51

score 46 · Answer 7 · 2026-03-25 06:12:47

46

Views

How to prove that models of indirect and direct RAM machines are equivalent?

Published on 25 Mar 2026 - 6:12

score 34 · Answer 8 · 2019-01-07 15:27:44

34

Views

exhibiting a turing machine and a λ-term of a boolean function

Published on 07 Jan 2019 - 15:27

score 140 · Answer 9 · 2019-01-08 05:37:14

140

Views

Definition of partial function using predicate that is possibly undecidable

Published on 08 Jan 2019 - 5:37

score 101 · Answer 10 · 2019-01-08 23:47:04

101

Views

Finding languages such that $L_{1} \subseteq L_{2} \subseteq L_{3}$ where $L_{1}, L_{3} \notin \mathbb{R}$, $L_{2} \in \mathbb{R}$

Published on 08 Jan 2019 - 23:47

score 1.1k · Answer 11 · 2019-01-09 17:01:18

1.1k

Views

Minimum Number of states turing machine

Published on 09 Jan 2019 - 17:01

score 73 · Answer 12 · 2019-01-09 17:39:09

73

Views

Finding languages such that $L_1\subset L_2\subset L_3$ where $L_1,L_3\notin$ RE and $L_2\in$ R

Published on 09 Jan 2019 - 17:39

score 83 · Answer 13 · 2019-01-10 10:22:14

83

Views

Decision function uncountable, why?

Published on 10 Jan 2019 - 10:22

score 212 · Answer 14 · 2019-01-11 12:31:15

212

Views

How can I prove that binary multiplication decision problem is solved in O(logn) space?

Published on 11 Jan 2019 - 12:31

score 226 · Answer 15 · 2019-01-12 00:01:41

226

Views

Is it possible to put a topology on Turing-recognizable languages to express density among all the languages?

Published on 12 Jan 2019 - 0:01

List Question

Why does a Turing machine take $n^k$ steps for computing an input?

Ultratasks in the ITTM Model

What exactly does it mean for an Infinite Time Turing Machine to reach stage $\omega$ (and limit ordinal stage)?

Exactly when and why can a Turing-machine not solve the halting problem?

What is the source of formal descriptions for large uncomputable ordinals clockable by Infinite Time Turing Machines?

Turing machine with read only part and finite tape

How to prove that models of indirect and direct RAM machines are equivalent?

exhibiting a turing machine and a λ-term of a boolean function

Definition of partial function using predicate that is possibly undecidable

Finding languages such that $L_{1} \subseteq L_{2} \subseteq L_{3}$ where $L_{1}, L_{3} \notin \mathbb{R}$, $L_{2} \in \mathbb{R}$

Minimum Number of states turing machine

Finding languages such that $L_1\subset L_2\subset L_3$ where $L_1,L_3\notin$ RE and $L_2\in$ R

Decision function uncountable, why?

How can I prove that binary multiplication decision problem is solved in O(logn) space?

Is it possible to put a topology on Turing-recognizable languages to express density among all the languages?

Trending Questions

Popular # Hahtags

Popular Questions