List questions from computability

Published on 05 Sep 2013 - 19:13

73

Views

A diophantine program for a basic For Loop

Published on 06 Sep 2013 - 23:11

320

Views

Arithmetic Hierarchy problems

Published on 08 Sep 2013 - 8:45

2.8k

Views

Why doesn't diagonalization prove that integers are not countable?

Published on 09 Sep 2013 - 3:26

2.2k

Views

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

Published on 28 Mar 2026 - 10:24

494

Views

Why is positional number system natural?

Published on 12 Sep 2013 - 0:31

3.9k

Views

Prove that transcendental numbers exist: Are there less paniful ways of doing it?

Published on 28 Mar 2026 - 10:27

691

Views

How is the Kleene normal form theorem for $\Sigma^1_1$ relations proved in RCA0?

Published on 25 Mar 2026 - 15:41

79

Views

Enumerating relations that are true infinitely often

Published on 26 Sep 2013 - 7:42

1k

Views

context free grammar design

Published on 28 Mar 2026 - 2:42

999

Views

Simultaneous recursion

Published on 01 Apr 2026 - 6:23

823

Views

context free grammar problem

Published on 28 Mar 2026 - 0:46

491

Views

Is ordinal analysis a non-recursive project?

Published on 30 Mar 2026 - 13:17

364

Views

A function agreeing with a primitive recursive function at all but finitely many points is primitive recursive

Published on 06 Oct 2013 - 5:31

92

Views

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

Published on 28 Mar 2026 - 10:16

List Question

Can this simple functional language be simplified further without losing any computational power?

A diophantine program for a basic For Loop

Arithmetic Hierarchy problems

Why doesn't diagonalization prove that integers are not countable?

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

Why is positional number system natural?

Prove that transcendental numbers exist: Are there less paniful ways of doing it?

How is the Kleene normal form theorem for $\Sigma^1_1$ relations proved in RCA0?

Enumerating relations that are true infinitely often

context free grammar design

Simultaneous recursion

context free grammar problem

Is ordinal analysis a non-recursive project?

A function agreeing with a primitive recursive function at all but finitely many points is primitive recursive

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

Trending Questions

Popular # Hahtags

Popular Questions