Question

Best approach for Undecidability proof

score 192 · Answer 1 · 2026-02-23 13:33:46

192

Views

Best approach for Undecidability proof

Published on 23 Feb 2026 - 13:33

score 143 · Answer 2 · 2026-03-26 07:57:18

143

Views

First value of the second order busy beaver function?

Published on 26 Mar 2026 - 7:57

score 213 · Answer 3 · 2026-02-23 21:11:29

213

Views

NP, NP-complete and Reducibility

Published on 23 Feb 2026 - 21:11

score 98 · Answer 4 · 2026-03-29 16:29:07

98

Views

Can we give an equivalent definition for computable numbers without mentioning turing machines?

Published on 29 Mar 2026 - 16:29

score 262 · Answer 5 · 2020-11-30 21:07:40

262

Views

Primitive recursive functions and sets

Published on 30 Nov 2020 - 21:07

score 52 · Answer 6 · 2020-12-01 13:21:27

52

Views

Does 'incomplete' mean the same thing in formal arithmetic compared to Godel's work?

Published on 01 Dec 2020 - 13:21

score 213 · Answer 7 · 2020-12-01 18:03:58

213

Views

The halting problem solved if there is an effective positive test for first-order entailment?

Published on 01 Dec 2020 - 18:03

score 212 · Answer 8 · 2020-12-07 19:37:37

212

Views

Understanding the definition of primitive recursion.

Published on 07 Dec 2020 - 19:37

score 123 · Answer 9 · 2020-12-10 02:48:29

123

Views

How do I prove that $A\subset N^k$ is recursively enumerable if and only if $A$ is the domain of a recursive relationship

Published on 10 Dec 2020 - 2:48

score 142 · Answer 10 · 2020-12-11 05:38:33

142

Views

The composition of $\Delta_0$ fn's $f, g: HF\to HF$ is not necessarily $\Delta_0$?

Published on 11 Dec 2020 - 5:38

score 122 · Answer 11 · 2026-02-23 22:48:15

122

Views

Let $f$ be a computable and injective function. Is $f^{-1}$ computable and injective?

Published on 23 Feb 2026 - 22:48

score 875 · Answer 12 · 2020-12-12 07:21:13

875

Views

Showing minimum between x and y is a primitive recursive function with initial functions

Published on 12 Dec 2020 - 7:21

score 167 · Answer 13 · 2026-03-30 17:07:03

167

Views

The Halting Problem -- why do we do the opposite?

Published on 30 Mar 2026 - 17:07

score 132 · Answer 14 · 2026-02-23 22:53:34

132

Views

What to do with undecidable problems?

Published on 23 Feb 2026 - 22:53

score 29 · Answer 15 · 2026-03-28 20:04:49

29

Views

Seeing that application in the PCA $A[f]$ is really a partial function

Published on 28 Mar 2026 - 20:04

List Question

Best approach for Undecidability proof

First value of the second order busy beaver function?

NP, NP-complete and Reducibility

Can we give an equivalent definition for computable numbers without mentioning turing machines?

Primitive recursive functions and sets

Does 'incomplete' mean the same thing in formal arithmetic compared to Godel's work?

The halting problem solved if there is an effective positive test for first-order entailment?

Understanding the definition of primitive recursion.

How do I prove that $A\subset N^k$ is recursively enumerable if and only if $A$ is the domain of a recursive relationship

The composition of $\Delta_0$ fn's $f, g: HF\to HF$ is not necessarily $\Delta_0$?

Let $f$ be a computable and injective function. Is $f^{-1}$ computable and injective?

Showing minimum between x and y is a primitive recursive function with initial functions

The Halting Problem -- why do we do the opposite?

What to do with undecidable problems?

Seeing that application in the PCA $A[f]$ is really a partial function

Trending Questions

Popular # Hahtags

Popular Questions