Question

What happens if the head of an Infinite Time Turing Machine is at the leftmost cell and the program dictates to move the head to the left?

score 1.6k · Answer 1 · 2019-08-03 15:28:19

What happens if the head of an Infinite Time Turing Machine is at the leftmost cell and the program dictates to move the head to the left?

score 116 · Answer 2 · 2026-03-23 12:48:24

116

Views

How strong is an oracle that avoid don't-halt

Published on 23 Mar 2026 - 12:48

score 155 · Answer 3 · 2019-08-09 17:37:27

155

Views

What are the implications of BB(8000) being independent of ZFC?

Published on 09 Aug 2019 - 17:37

score 65 · Answer 4 · 2019-08-17 20:42:15

65

Views

Does this turing machine exist?

Published on 17 Aug 2019 - 20:42

score 156 · Answer 5 · 2019-09-16 12:11:26

156

Views

Is there a Turing machine that limit-compute if some other TM halts on all inputs?

Published on 16 Sep 2019 - 12:11

score 262 · Answer 6 · 2019-09-25 07:35:33

262

Views

Are there programs that a Turing machine cannot run simultaneously?

Published on 25 Sep 2019 - 7:35

score 658 · Answer 7 · 2026-02-23 06:34:36

658

Views

Halting problem within a finite time interval?

Published on 23 Feb 2026 - 6:34

score 6.1k · Answer 8 · 2026-02-23 06:34:11

6.1k

Views

Non-Turing Recognisable Languages

Published on 23 Feb 2026 - 6:34

score 777 · Answer 9 · 2014-03-11 15:36:19

777

Views

A turing machine which computes the same language as a "stay put" turing machine

Published on 11 Mar 2014 - 15:36

score 8.8k · Answer 10 · 2014-03-13 13:08:40

8.8k

Views

Accepting/rejecting states in Turing Machine

Published on 13 Mar 2014 - 13:08

score 199 · Answer 11 · 2014-03-13 18:26:13

199

Views

Showing a Problem Is Undecidable

Published on 13 Mar 2014 - 18:26

score 622 · Answer 12 · 2014-03-16 21:34:17

622

Views

Recursively Enumerable Languages and Turing Machines

Published on 16 Mar 2014 - 21:34

score 7.1k · Answer 13 · 2014-03-17 00:53:37

7.1k

Views

Build a deterministic turing machine to decide L = { ww }

Published on 17 Mar 2014 - 0:53

score 2.2k · Answer 14 · 2026-03-25 01:16:22

2.2k

Views

Milton Green's lower bounds of the busy beaver function

Published on 25 Mar 2026 - 1:16

score 5.4k · Answer 15 · 2014-03-29 23:55:14

5.4k

Views

What's the difference between a non-deterministic turing machine and a deterministic turing machine?

Published on 29 Mar 2014 - 23:55

List Question

What happens if the head of an Infinite Time Turing Machine is at the leftmost cell and the program dictates to move the head to the left?

How strong is an oracle that avoid don't-halt

What are the implications of BB(8000) being independent of ZFC?

Does this turing machine exist?

Is there a Turing machine that limit-compute if some other TM halts on all inputs?

Are there programs that a Turing machine cannot run simultaneously?

Halting problem within a finite time interval?

Non-Turing Recognisable Languages

A turing machine which computes the same language as a "stay put" turing machine

Accepting/rejecting states in Turing Machine

Showing a Problem Is Undecidable

Recursively Enumerable Languages and Turing Machines

Build a deterministic turing machine to decide L = { ww }

Milton Green's lower bounds of the busy beaver function

What's the difference between a non-deterministic turing machine and a deterministic turing machine?

Trending Questions

Popular # Hahtags

Popular Questions