Question

Ackermann function property for positive $n$

score 223 · Answer 1 · 2026-05-02 05:10:58

223

Views

Ackermann function property for positive $n$

Published on 02 May 2026 - 5:10

score 491 · Answer 2 · 2026-04-17 04:07:06

491

Views

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

Published on 17 Apr 2026 - 4:07

score 82 · Answer 3 · 2026-05-10 16:29:36

82

Views

a hard mapping reduction problem

Published on 10 May 2026 - 16:29

score 169 · Answer 4 · 2026-04-13 11:41:26

169

Views

Increasing primitive recursive function range.

Published on 13 Apr 2026 - 11:41

score 110 · Answer 5 · 2026-04-14 00:23:15

110

Views

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

Published on 14 Apr 2026 - 0:23

score 190 · Answer 6 · 2026-05-10 10:01:34

190

Views

Transcendental numbers

Published on 10 May 2026 - 10:01

score 106 · Answer 7 · 2026-05-10 16:02:40

106

Views

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

Published on 10 May 2026 - 16:02

score 267 · Answer 8 · 2026-04-17 07:43:26

267

Views

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

Published on 17 Apr 2026 - 7:43

score 57 · Answer 9 · 2026-04-11 19:30:04

57

Views

Is this function computable?

Published on 11 Apr 2026 - 19:30

score 104 · Answer 10 · 2026-05-10 16:23:04

104

Views

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

Published on 10 May 2026 - 16:23

score 123 · Answer 11 · 2026-04-11 10:37:50

123

Views

Proving that a separating set is not computable

Published on 11 Apr 2026 - 10:37

score 153 · Answer 12 · 2026-04-14 09:43:45

153

Views

Completeness property and computability

Published on 14 Apr 2026 - 9:43

score 64 · Answer 13 · 2026-04-14 17:54:52

64

Views

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

Published on 14 Apr 2026 - 17:54

score 111 · Answer 14 · 2026-04-12 04:52:45

111

Views

Repeated minimization

Published on 12 Apr 2026 - 4:52

score 156 · Answer 15 · 2026-04-10 04:02:44

156

Views

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

Published on 10 Apr 2026 - 4:02

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