List questions from turing-machines

Published on 10 Jun 2013 - 20:08

89

Views

problem understanding a solution of Talbot's book (complexity and cryptography)

Published on 11 Jun 2013 - 7:13

164

Views

Unknown symbol '#' in set

Published on 09 Jul 2013 - 8:29

159

Views

Why do complex grammars require powerful algorithms?

Published on 27 Mar 2026 - 23:12

167

Views

Trying to describe this Turing Machine

Published on 17 Aug 2013 - 3:46

270

Views

Will this Turing machine ever halt?

Published on 04 Sep 2013 - 21:13

2.2k

Views

Proof of undecidability of $FINITE_{\text{TM}}$ and $USELESS_{\text{TM}}$

Published on 10 Sep 2013 - 14:27

368

Views

Lower bounds for bb(7) and bb(8) wanted

Published on 21 Sep 2013 - 21:43

1k

Views

How do you argue (or prove) that a certain Turing machine accepts a language?

Published on 24 Sep 2013 - 18:35

609

Views

Time constructible, non-time constructible functions

Published on 03 Oct 2013 - 21:54

91

Views

Is recursive join of a sequence of low sets also low?

Published on 07 Oct 2013 - 22:20

168

Views

Recursively enumerable language of Turing machines

Published on 14 Oct 2013 - 20:37

226

Views

Turing machines and tape complexity

Published on 17 Oct 2013 - 9:50

359

Views

Constant value function Turing machine.

Published on 19 Oct 2013 - 21:58

71

Views

Is the language that consists of machine configurations whose language is a subset of even palindromes semi-decidable?

Published on 20 Oct 2013 - 19:15

List Question

the time required to decide $L$

problem understanding a solution of Talbot's book (complexity and cryptography)

Unknown symbol '#' in set

Why do complex grammars require powerful algorithms?

Trying to describe this Turing Machine

Will this Turing machine ever halt?

Proof of undecidability of $FINITE_{\text{TM}}$ and $USELESS_{\text{TM}}$

Lower bounds for bb(7) and bb(8) wanted

How do you argue (or prove) that a certain Turing machine accepts a language?

Time constructible, non-time constructible functions

Is recursive join of a sequence of low sets also low?

Recursively enumerable language of Turing machines

Turing machines and tape complexity

Constant value function Turing machine.

Is the language that consists of machine configurations whose language is a subset of even palindromes semi-decidable?

Trending Questions

Popular # Hahtags

Popular Questions