List questions from turing-machines

Published on 03 Nov 2017 - 20:19

798

Views

Prove that L = {<M> | <M>∈ L(M)} is undecidable

Published on 05 Nov 2017 - 1:27

737

Views

Prove that a given language is not recursively enumerable.

Published on 08 Nov 2017 - 11:02

2.6k

Views

Why did nobody prove undecidability by the "too many problems" argument?

Published on 22 Nov 2017 - 18:57

3.8k

Views

Hamiltonian Path to Hamiltonian Cycle reduction

Published on 26 Mar 2026 - 2:54

737

Views

How many variables can a standard Turing Machine write?

Published on 29 Nov 2017 - 3:57

424

Views

How do we show that Rado's function (for the Busy Beaver Algorithm) is non-computable?

Published on 29 Nov 2017 - 18:48

338

Views

Compute any real number, given an uncountable set of real numbers?

Published on 29 Nov 2017 - 21:59

65

Views

Cases of additive groups in which addition is "rightward elongation" and subtraction is "leftward elongation" of a left-to-right ordered string

Published on 28 Mar 2026 - 16:05

111

Views

Build Turing Machine

Published on 02 Dec 2017 - 17:00

112

Views

How to do reduction?

Published on 03 Dec 2017 - 15:47

68

Views

Reductions: Turing Machines

Published on 04 Dec 2017 - 9:08

71

Views

Relations between Complexity Classes

Published on 06 Dec 2017 - 10:42

39

Views

Examples of $X$ halts IFF $Y$ does not halt?

Published on 06 Dec 2017 - 22:36

132

Views

Model-invariant definitions of fine-grained time complexity?

Published on 08 Dec 2017 - 6:49

List Question

Turing Machine - automata

Prove that L = {<M> | <M>∈ L(M)} is undecidable

Prove that a given language is not recursively enumerable.

Why did nobody prove undecidability by the "too many problems" argument?

Hamiltonian Path to Hamiltonian Cycle reduction

How many variables can a standard Turing Machine write?

How do we show that Rado's function (for the Busy Beaver Algorithm) is non-computable?

Compute any real number, given an uncountable set of real numbers?

Cases of additive groups in which addition is "rightward elongation" and subtraction is "leftward elongation" of a left-to-right ordered string

Build Turing Machine

How to do reduction?

Reductions: Turing Machines

Relations between Complexity Classes

Examples of $X$ halts IFF $Y$ does not halt?

Model-invariant definitions of fine-grained time complexity?

Trending Questions

Popular # Hahtags

Popular Questions