List questions from computability

Published on 27 Oct 2013 - 4:58

161

Views

Genericity and category

Published on 25 Mar 2026 - 23:34

487

Views

Primitive recursive functions with a restriction on the arity of projections

Published on 28 Oct 2013 - 23:05

951

Views

Algorithm for valid 3 coloring.

Published on 27 Mar 2026 - 10:16

981

Views

Is definition by cases a primitive recursive function?

Published on 04 Nov 2013 - 10:56

442

Views

Eager vs. lazy interpretation of recursive functions

Published on 23 Feb 2026 - 4:53

574

Views

Primitive recursive and Turing machines

Published on 28 Mar 2026 - 11:52

134

Views

Suppose $f(x)$ is a total computable function. Use minimlization to show that there is a computable function $g(y)$

Published on 07 Nov 2013 - 13:08

625

Views

Computably enumerable and partial functions

Published on 28 Mar 2026 - 13:30

122

Views

An effective coding of $\mathbb N^*$

Published on 09 Nov 2013 - 8:06

2.4k

Views

Books about Turing machines and undecidability

Published on 09 Nov 2013 - 19:29

114

Views

Basic reductions

Published on 12 Nov 2013 - 0:21

77

Views

Showing particular language is NP-complete

Published on 12 Nov 2013 - 7:19

426

Views

Computability and the Halting Problem

Published on 13 Nov 2013 - 1:14

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 28 Mar 2026 - 13:42

List Question

If P = NP, then 3-SAT can be solved in P

Genericity and category

Primitive recursive functions with a restriction on the arity of projections

Algorithm for valid 3 coloring.

Is definition by cases a primitive recursive function?

Eager vs. lazy interpretation of recursive functions

Primitive recursive and Turing machines

Suppose $f(x)$ is a total computable function. Use minimlization to show that there is a computable function $g(y)$

Computably enumerable and partial functions

An effective coding of $\mathbb N^*$

Books about Turing machines and undecidability

Basic reductions

Showing particular language is NP-complete

Computability and the Halting Problem

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

Trending Questions

Popular # Hahtags

Popular Questions