List questions from turing-machines

Published on 06 May 2017 - 16:52

716

Views

Designing a Turing Machine for $f(n) = 4⌊(1/4)n⌋ +1$

Published on 07 May 2017 - 4:52

115

Views

Reductions in computability theory

Published on 07 May 2017 - 19:20

1.3k

Views

Diagonalization on turing machines and proofs. Where does the argument fail?

Published on 09 May 2017 - 7:50

62

Views

Proof language classification using reduction mapping

Published on 14 May 2017 - 14:51

1k

Views

A mapping reduction to show that L is unrecognizable and so it's complement

Published on 25 Mar 2026 - 17:37

545

Views

Using rice theorem to prove undecidability of a machine that rejects

Published on 15 May 2017 - 9:32

514

Views

Does "whenever / whether" equals to iff?

Published on 20 May 2017 - 8:30

198

Views

Is this function computable and total?

Published on 23 Feb 2026 - 15:27

373

Views

How can I prove that this function is computable?

Published on 24 May 2017 - 17:18

1.5k

Views

How to construct Turing Machine for the language $L= \{0^t \mid t \text{ is a composite number }\}$

Published on 27 May 2017 - 7:36

126

Views

Reduction from $A_{TM}$ to $L$ where $w_1$ is prefix of $w_2$

Published on 29 May 2017 - 12:06

55

Views

Combinatorial Problems, Normal Systems

Published on 23 Feb 2026 - 15:27

44

Views

A version of SAT

Published on 27 Mar 2026 - 4:34

94

Views

Could we design a Turing machine that output every bit of $\pi$ one after another correctly with limited tape length?

Published on 09 Jun 2017 - 19:18

List Question

How #P is easier than PSPACE?

Designing a Turing Machine for $f(n) = 4⌊(1/4)n⌋ +1$

Reductions in computability theory

Diagonalization on turing machines and proofs. Where does the argument fail?

Proof language classification using reduction mapping

A mapping reduction to show that L is unrecognizable and so it's complement

Using rice theorem to prove undecidability of a machine that rejects

Does "whenever / whether" equals to iff?

Is this function computable and total?

How can I prove that this function is computable?

How to construct Turing Machine for the language $L= \{0^t \mid t \text{ is a composite number }\}$

Reduction from $A_{TM}$ to $L$ where $w_1$ is prefix of $w_2$

Combinatorial Problems, Normal Systems

A version of SAT

Could we design a Turing machine that output every bit of $\pi$ one after another correctly with limited tape length?

Trending Questions

Popular # Hahtags

Popular Questions