1. Given a Turing Machine T , are there any input strings on which T loops forever? 2. Given a Turing Machine T and a string w, does T reject input w?

score 269 · Answer 8 · 2022-02-07 18:24:19

269

Views

Computability (Cutland) vs. Computability, Complexity and Languages (Davis et al.)

Published on 07 Feb 2022 - 18:24

score 128 · Answer 9 · 2022-02-26 03:57:36

128

Views

Universal property of Turing machine

Published on 26 Feb 2022 - 3:57

score 66 · Answer 10 · 2026-03-29 14:07:20

66

Views

Would a proof-search for a contradiction halt in non-standard models of PA arithmetic?

Published on 29 Mar 2026 - 14:07

score 245 · Answer 11 · 2022-03-08 10:00:51

245

Views

Is it possible to have a Turing-complete language that can't possibly go into an infinite loop?

Published on 08 Mar 2022 - 10:00

score 424 · Answer 12 · 2022-03-09 00:46:05

424

Views

Turing machine, alphabet: $\{0,1\}$, accepts any word $w$, and on the tape the word $w$ is written followed by $0$-s as the number of the $1$-s in $w$

Published on 09 Mar 2022 - 0:46

score 77 · Answer 13 · 2026-02-24 05:09:31

77

Views

Are there any statements that are n-undecidable for all n?

Published on 24 Feb 2026 - 5:09

score 748 · Answer 14 · 2022-04-09 15:16:28

748

Views

How does this definition of a computable function work?

Published on 09 Apr 2022 - 15:16

score 42 · Answer 15 · 2022-04-10 01:58:51

42

Views

Is it possible for a programme to return an output with more entropy than the entropy of the programme's code itself?

Published on 10 Apr 2022 - 1:58

List Question

How to show that if there's a mapping reduction from L to its complement, it doesn't imply that L∈R?

Running an infinite amount of Turing Machine steps in a finite amount of time: What consequences?

How is Kolmogorov complexity calculated?

turing-reduction Proof: $A = \{(u,v) | T(M_u) \subseteq T(M_v)\}$ by showing $H_0 \leq A$

Is self-reference required to show the halting problem is undecidable?

Intuitve Proof that the halting set is recursively enumerable

1. Given a Turing Machine T , are there any input strings on which T loops forever? 2. Given a Turing Machine T and a string w, does T reject input w?

Computability (Cutland) vs. Computability, Complexity and Languages (Davis et al.)

Universal property of Turing machine

Would a proof-search for a contradiction halt in non-standard models of PA arithmetic?

Is it possible to have a Turing-complete language that can't possibly go into an infinite loop?

Turing machine, alphabet: $\{0,1\}$, accepts any word $w$, and on the tape the word $w$ is written followed by $0$-s as the number of the $1$-s in $w$

Are there any statements that are n-undecidable for all n?

How does this definition of a computable function work?

Is it possible for a programme to return an output with more entropy than the entropy of the programme's code itself?

Trending Questions

Popular # Hahtags

Popular Questions