List questions from turing-machines

Published on 03 Nov 2013 - 21:05

101

Views

(2,5) Turing Machine implemented with chess pieces

Published on 04 Nov 2013 - 7:13

573

Views

Primitive recursive and Turing machines

Published on 05 Nov 2013 - 13:02

624

Views

Computably enumerable and partial functions

Published on 07 Nov 2013 - 23:18

2.5k

Views

Show that the language TOT={<M> | M is a Turing Machine that halts with all inputs} is not recursively enumerable nor its complement.

Published on 13 Nov 2013 - 1:56

8.1k

Views

Turing Machine for comparing, copying, and operating

Published on 30 Nov 2013 - 20:11

4.9k

Views

Blanks in the Tape of a Turing Machine

Published on 03 Dec 2013 - 12:01

224

Views

Assign Integer to Each Turing Machine

Published on 07 Dec 2013 - 4:12

589

Views

Reducing A$_\text{TM}$ to REGULAR$_\text{TM}$

Published on 10 Dec 2013 - 13:48

455

Views

Oracle Turing machine - $E_{\text{TM}}$ and $PCP$.

Published on 24 Mar 2026 - 21:47

259

Views

Concrete universal turing machine

Published on 14 Dec 2013 - 15:36

2.7k

Views

Solving the halting problem for almost all machines?

Published on 26 Dec 2013 - 23:30

106

Views

Given a single taped deterministic turing machine what's the least amount of calculations needed in order to receive the language

Published on 30 Dec 2013 - 22:45

433

Views

Extended PDA vs TM

Published on 01 Jan 2014 - 19:46

5.5k

Views

prove Turing recognizable

Published on 02 Jan 2014 - 23:16

List Question

Undecidability of REGULAR_TM

(2,5) Turing Machine implemented with chess pieces

Primitive recursive and Turing machines

Computably enumerable and partial functions

Show that the language TOT={<M> | M is a Turing Machine that halts with all inputs} is not recursively enumerable nor its complement.

Turing Machine for comparing, copying, and operating

Blanks in the Tape of a Turing Machine

Assign Integer to Each Turing Machine

Reducing A$_\text{TM}$ to REGULAR$_\text{TM}$

Oracle Turing machine - $E_{\text{TM}}$ and $PCP$.

Concrete universal turing machine

Solving the halting problem for almost all machines?

Given a single taped deterministic turing machine what's the least amount of calculations needed in order to receive the language

Extended PDA vs TM

prove Turing recognizable

Trending Questions

Popular # Hahtags

Popular Questions