Question

all recursive functions are turing computable

score 154 · Answer 1 · 2026-03-27 22:59:27

all recursive functions are turing computable

Published on 27 Mar 2026 - 22:59

score 199 · Answer 2 · 2016-01-30 19:19:13

A subset of $ \mathbb{N}$ is recursively enumerable iff it is the range of some recursive function from $\mathbb{N }$ to $\mathbb{N}$.

score 113 · Answer 3 · 2026-03-27 14:54:00

113

Views

Does the existence of uncomputable functions imply that a theory is incomplete?

Published on 27 Mar 2026 - 14:54

score 69 · Answer 4 · 2016-02-01 03:01:56

69

Views

Direct constuction of nonlow noncomplete c.e. sets

Published on 01 Feb 2016 - 3:01

score 561 · Answer 5 · 2016-02-01 23:11:22

561

Views

(Enumerable) set of natural numbers might not be effectively enumerable

Published on 01 Feb 2016 - 23:11

score 1.4k · Answer 6 · 2016-02-02 21:29:42

1.4k

Views

Every infinite recursive set has a recursively enumerable subset which is not recursive.

Published on 02 Feb 2016 - 21:29

score 259 · Answer 7 · 2016-02-02 21:36:45

259

Views

There are infinitely many recursively enumerable subsets of the natural numbers which are not recursive

Published on 02 Feb 2016 - 21:36

score 1.2k · Answer 8 · 2026-03-30 13:54:46

1.2k

Views

Emptiness and infiniteness decidable for recursive languages?

Published on 30 Mar 2026 - 13:54

score 94 · Answer 9 · 2026-03-30 04:39:58

94

Views

Is it possible to create a software to find formal proofs?

Published on 30 Mar 2026 - 4:39

score 927 · Answer 10 · 2026-03-27 23:00:53

927

Views

Is there a way to prove that a Turing machine computes the function we designed it to?

Published on 27 Mar 2026 - 23:00

score 615 · Answer 11 · 2016-02-07 15:33:01

615

Views

Intuitive meaning of the concept “computable”

Published on 07 Feb 2016 - 15:33

score 524 · Answer 12 · 2026-03-31 22:46:50

524

Views

Is the set of languages over an alphabet Σ missing k words from Σ* countable?

Published on 31 Mar 2026 - 22:46

score 1.8k · Answer 13 · 2026-03-27 23:01:35

1.8k

Views

Showing set is undecidable with Turing Machines

Published on 27 Mar 2026 - 23:01

score 3.3k · Answer 14 · 2016-02-12 08:44:53

3.3k

Views

Proove that Unions and intersections of recursively enumerable sets are also recursively enumerable

Published on 12 Feb 2016 - 8:44

score 423 · Answer 15 · 2026-03-27 23:01:34

423

Views

Reduction to/from REC and RE language?

Published on 27 Mar 2026 - 23:01

List Question

all recursive functions are turing computable

A subset of $ \mathbb{N}$ is recursively enumerable iff it is the range of some recursive function from $\mathbb{N }$ to $\mathbb{N}$.

Does the existence of uncomputable functions imply that a theory is incomplete?

Direct constuction of nonlow noncomplete c.e. sets

(Enumerable) set of natural numbers might not be effectively enumerable

Every infinite recursive set has a recursively enumerable subset which is not recursive.

There are infinitely many recursively enumerable subsets of the natural numbers which are not recursive

Emptiness and infiniteness decidable for recursive languages?

Is it possible to create a software to find formal proofs?

Is there a way to prove that a Turing machine computes the function we designed it to?

Intuitive meaning of the concept “computable”

Is the set of languages over an alphabet Σ missing k words from Σ* countable?

Showing set is undecidable with Turing Machines

Proove that Unions and intersections of recursively enumerable sets are also recursively enumerable

Reduction to/from REC and RE language?

Trending Questions

Popular # Hahtags

Popular Questions