Question

What's the $e^{th}$ partial recursive function?

score 81 · Answer 1 · 2019-12-23 20:10:10

81

Views

What's the $e^{th}$ partial recursive function?

Published on 23 Dec 2019 - 20:10

score 110 · Answer 2 · 2026-03-25 17:26:10

110

Views

Can Higman's embedding theorem be generalised that way?

Published on 25 Mar 2026 - 17:26

score 56 · Answer 3 · 2026-03-25 18:59:10

56

Views

Do there exist such groups $G$, such that $(A \cup A^{-1})^* \setminus L(G, A)$ is recursively enumerable, but $L(G, A)$ isn't?

Published on 25 Mar 2026 - 18:59

score 816 · Answer 4 · 2020-01-03 17:11:41

816

Views

Why is differentiation straightforward while integration methods seem like a bag of edge cases?

Published on 03 Jan 2020 - 17:11

score 94 · Answer 5 · 2020-01-04 13:09:59

94

Views

Is this given set recursive, r.e. or none of them? Informal argument ok?

Published on 04 Jan 2020 - 13:09

score 215 · Answer 6 · 2020-01-07 17:28:24

215

Views

On the definition of a Turing Machine as stated in Soare

Published on 07 Jan 2020 - 17:28

score 67 · Answer 7 · 2020-01-08 21:34:05

67

Views

Is there such a thing as the set of "definable" numbers?

Published on 08 Jan 2020 - 21:34

score 93 · Answer 8 · 2020-01-10 11:00:23

93

Views

why is $g(x)=\phi(x,x)$ still a recursive function

Published on 10 Jan 2020 - 11:00

score 169 · Answer 9 · 2026-03-25 20:35:47

169

Views

Does there exist a context free formal language, the complement to which is not recursively enumerable?

Published on 25 Mar 2026 - 20:35

score 50 · Answer 10 · 2020-01-14 13:15:12

50

Views

Turing computability between subsets

Published on 14 Jan 2020 - 13:15

score 56 · Answer 11 · 2026-03-25 04:38:01

56

Views

Show that the language $L$ is not regular

Published on 25 Mar 2026 - 4:38

score 131 · Answer 12 · 2020-01-14 17:22:51

131

Views

Is a subset of a recursively enumerable set also recursively enumerable?

Published on 14 Jan 2020 - 17:22

score 510 · Answer 13 · 2026-03-25 17:39:43

510

Views

Once a mathematical theorem is proven true like the Halting problem can it ever be disproven?

Published on 25 Mar 2026 - 17:39

score 131 · Answer 14 · 2020-01-19 17:30:15

131

Views

Proof that The termination analysis is $\Pi_2$ undecidable

Published on 19 Jan 2020 - 17:30

score 153 · Answer 15 · 2026-03-27 23:19:59

153

Views

Closure of Arithmetical Hierarchy under logical equivalence

Published on 27 Mar 2026 - 23:19

List Question

What's the $e^{th}$ partial recursive function?

Can Higman's embedding theorem be generalised that way?

Do there exist such groups $G$, such that $(A \cup A^{-1})^* \setminus L(G, A)$ is recursively enumerable, but $L(G, A)$ isn't?

Why is differentiation straightforward while integration methods seem like a bag of edge cases?

Is this given set recursive, r.e. or none of them? Informal argument ok?

On the definition of a Turing Machine as stated in Soare

Is there such a thing as the set of "definable" numbers?

why is $g(x)=\phi(x,x)$ still a recursive function

Does there exist a context free formal language, the complement to which is not recursively enumerable?

Turing computability between subsets

Show that the language $L$ is not regular

Is a subset of a recursively enumerable set also recursively enumerable?

Once a mathematical theorem is proven true like the Halting problem can it ever be disproven?

Proof that The termination analysis is $\Pi_2$ undecidable

Closure of Arithmetical Hierarchy under logical equivalence

Trending Questions

Popular # Hahtags

Popular Questions