Question

Ackermann function property for positive $n$

score 212 · Answer 1 · 2026-03-23 11:09:59

212

Views

Ackermann function property for positive $n$

Published on 23 Mar 2026 - 11:09

score 488 · Answer 2 · 2018-05-23 16:10:13

488

Views

If the halting set is Turing-reducible to a c.e. set B, is B m-equivalent to the halting set?

Published on 23 May 2018 - 16:10

score 77 · Answer 3 · 2026-03-25 06:07:21

77

Views

a hard mapping reduction problem

Published on 25 Mar 2026 - 6:07

score 165 · Answer 4 · 2018-05-27 14:03:20

165

Views

Increasing primitive recursive function range.

Published on 27 May 2018 - 14:03

score 107 · Answer 5 · 2018-05-30 06:31:15

107

Views

Are the "weakly computable" sets precisely the arithmetical sets?

Published on 30 May 2018 - 6:31

score 182 · Answer 6 · 2026-03-22 18:47:15

182

Views

Transcendental numbers

Published on 22 Mar 2026 - 18:47

score 104 · Answer 7 · 2026-03-25 09:32:07

104

Views

Proving $L=\left\{ \left\langle M\right\rangle \mid L\left(M\right)=A_{TM}\right\} \in\overline{RE\cup coRE}$

Published on 25 Mar 2026 - 9:32

score 264 · Answer 8 · 2026-03-25 11:53:15

264

Views

Do recursively enumerable subsets of $\mathbb{N}$ have a least element

Published on 25 Mar 2026 - 11:53

score 52 · Answer 9 · 2018-06-03 12:46:20

52

Views

Is this function computable?

Published on 03 Jun 2018 - 12:46

score 100 · Answer 10 · 2018-06-06 21:27:19

100

Views

Can bounded addition and multiplication be computable in a non-standard model of arithmetic?

Published on 06 Jun 2018 - 21:27

score 120 · Answer 11 · 2018-06-12 09:35:40

120

Views

Proving that a separating set is not computable

Published on 12 Jun 2018 - 9:35

score 148 · Answer 12 · 2018-06-20 13:14:16

148

Views

Completeness property and computability

Published on 20 Jun 2018 - 13:14

score 62 · Answer 13 · 2018-06-21 12:28:50

62

Views

$\alpha$-computable set is $\alpha$-finite if $\alpha^*<\alpha$

Published on 21 Jun 2018 - 12:28

score 106 · Answer 14 · 2018-06-22 09:37:33

106

Views

Repeated minimization

Published on 22 Jun 2018 - 9:37

score 153 · Answer 15 · 2018-06-22 19:24:15

153

Views

The Primitive Recursivity of the Universal Predicate for the Godel numbering of partial recusive functions

Published on 22 Jun 2018 - 19:24

List Question

Ackermann function property for positive $n$

If the halting set is Turing-reducible to a c.e. set B, is B m-equivalent to the halting set?

a hard mapping reduction problem

Increasing primitive recursive function range.

Are the "weakly computable" sets precisely the arithmetical sets?

Transcendental numbers

Proving $L=\left\{ \left\langle M\right\rangle \mid L\left(M\right)=A_{TM}\right\} \in\overline{RE\cup coRE}$

Do recursively enumerable subsets of $\mathbb{N}$ have a least element

Is this function computable?

Can bounded addition and multiplication be computable in a non-standard model of arithmetic?

Proving that a separating set is not computable

Completeness property and computability

$\alpha$-computable set is $\alpha$-finite if $\alpha^*<\alpha$

Repeated minimization

The Primitive Recursivity of the Universal Predicate for the Godel numbering of partial recusive functions

Trending Questions

Popular # Hahtags

Popular Questions