Question

Why can't we diagonalize out, if we deal with partial functions?

score 285 · Answer 1 · 2011-04-30 20:40:08

285

Views

Why can't we diagonalize out, if we deal with partial functions?

Published on 30 Apr 2011 - 20:40

score 199 · Answer 2 · 2011-04-30 21:22:57

199

Views

Recursive set that contains in a way all the other recursive ones?

Published on 30 Apr 2011 - 21:22

score 285 · Answer 3 · 2011-04-30 21:24:37

285

Views

Weaker definition of recursively enumerable sets

Published on 30 Apr 2011 - 21:24

score 4k · Answer 4 · 2011-05-01 20:44:38

4k

Views

How can I prove that this set is recursively enumerable?

Published on 01 May 2011 - 20:44

score 3k · Answer 5 · 2011-05-03 15:52:05

3k

Views

To Prove an undecidable language on halting

Published on 03 May 2011 - 15:52

score 348 · Answer 6 · 2011-05-04 05:25:12

348

Views

Is every recursively enumerable set $A \subseteq \mathbb{N}$ also recursive?

Published on 04 May 2011 - 5:25

score 187 · Answer 7 · 2011-05-07 19:07:48

187

Views

Question about the "source code" of a recursive function

Published on 07 May 2011 - 19:07

score 399 · Answer 8 · 2011-05-07 19:13:14

399

Views

Algorithm to tell if a partial recursive function is 0 everywhere

Published on 07 May 2011 - 19:13

score 10.3k · Answer 9 · 2011-05-09 06:59:35

10.3k

Views

Example of a not recursively enumerable set $A \subseteq \mathbb{N}$

Published on 09 May 2011 - 6:59

score 303 · Answer 10 · 2011-05-15 20:24:56

303

Views

Recursive function that outputs its own code

Published on 15 May 2011 - 20:24

score 237 · Answer 11 · 2026-03-28 07:37:17

237

Views

Construction of a sequence of theorems with increasing and unbounded "difficulty"?

Published on 28 Mar 2026 - 7:37

score 4.9k · Answer 12 · 2026-03-28 03:52:52

4.9k

Views

Easy proofs of the undecidability of Wang's tiling problem?

Published on 28 Mar 2026 - 3:52

score 137 · Answer 13 · 2011-05-27 19:58:09

137

Views

Slick way to define p.c. $f$ so that $f(e) \in W_{e}$

Published on 27 May 2011 - 19:58

score 129 · Answer 14 · 2011-06-04 03:51:53

129

Views

Why isn't it enough to enforce $w \in A \Rightarrow f(w) \in B$ before allowing a reduction from A to B?

Published on 04 Jun 2011 - 3:51

score 3.9k · Answer 15 · 2011-06-04 18:45:26

3.9k

Views

Example of function which is not computable

Published on 04 Jun 2011 - 18:45

List Question

Why can't we diagonalize out, if we deal with partial functions?

Recursive set that contains in a way all the other recursive ones?

Weaker definition of recursively enumerable sets

How can I prove that this set is recursively enumerable?

To Prove an undecidable language on halting

Is every recursively enumerable set $A \subseteq \mathbb{N}$ also recursive?

Question about the "source code" of a recursive function

Algorithm to tell if a partial recursive function is 0 everywhere

Example of a not recursively enumerable set $A \subseteq \mathbb{N}$

Recursive function that outputs its own code

Construction of a sequence of theorems with increasing and unbounded "difficulty"?

Easy proofs of the undecidability of Wang's tiling problem?

Slick way to define p.c. $f$ so that $f(e) \in W_{e}$

Why isn't it enough to enforce $w \in A \Rightarrow f(w) \in B$ before allowing a reduction from A to B?

Example of function which is not computable

Trending Questions

Popular # Hahtags

Popular Questions