List questions from computability

Published on 08 May 2014 - 8:13

726

Views

Range/Image of a Non-Decreasing Total Recursive Function is Recursive

Published on 08 May 2014 - 15:08

425

Views

Proving something is primitive recursive

Published on 08 May 2014 - 16:44

321

Views

Computability: why any m-degree a is denumerable?

Published on 09 May 2014 - 7:35

407

Views

Polynomial Reduction for restriction

Published on 25 Mar 2026 - 17:28

876

Views

Diophantine equations and Hilbert's 10th Problem, how did MRDP do it?

Published on 15 May 2014 - 0:03

111

Views

A constructive algorithm for a jump of a low set.

Published on 25 Mar 2026 - 23:09

106

Views

Directed Hamiltonian Reduction

Published on 17 May 2014 - 14:25

427

Views

Prove that these Sets Containing Infinitely Many Incompressible Strings Exist

Published on 25 Mar 2026 - 4:38

292

Views

Why should we accept the existence of subsets $A$ such that neither $A$ nor $A^c$ are recursively ennumerable? And how can we persuade others?

Published on 25 Mar 2026 - 5:10

167

Views

Question about the definition of Diophantine sets

Published on 25 May 2014 - 20:52

4.5k

Views

Proving that $\Omega = (\lambda x.xx)(\lambda x.xx)$ is not typable in the simply typed lambda calculus

Published on 26 Mar 2026 - 9:49

131

Views

Nonstandard models of PA with a decidable order relation.

Published on 25 Mar 2026 - 1:16

102

Views

Bijection of simple set

Published on 04 Jun 2014 - 20:14

116

Views

Uncomputability of $a<b$ or $b<a$

Published on 08 Jun 2014 - 18:33

List Question

Problem from Cutland's Computability

Range/Image of a Non-Decreasing Total Recursive Function is Recursive

Proving something is primitive recursive

Computability: why any m-degree a is denumerable?

Polynomial Reduction for restriction

Diophantine equations and Hilbert's 10th Problem, how did MRDP do it?

A constructive algorithm for a jump of a low set.

Directed Hamiltonian Reduction

Prove that these Sets Containing Infinitely Many Incompressible Strings Exist

Why should we accept the existence of subsets $A$ such that neither $A$ nor $A^c$ are recursively ennumerable? And how can we persuade others?

Question about the definition of Diophantine sets

Proving that $\Omega = (\lambda x.xx)(\lambda x.xx)$ is not typable in the simply typed lambda calculus

Nonstandard models of PA with a decidable order relation.

Bijection of simple set

Uncomputability of $a<b$ or $b<a$

Trending Questions

Popular # Hahtags

Popular Questions