Question

Seeking Alternate Proof Regarding Closure Of Recursively Enumerable Languages Under Shrink

score 154 · Answer 1 · 2012-11-26 06:12:54

154

Views

Seeking Alternate Proof Regarding Closure Of Recursively Enumerable Languages Under Shrink

Published on 26 Nov 2012 - 6:12

score 463 · Answer 2 · 2026-03-28 16:05:19

463

Views

I do not understand why the Turing computable sets of N are exactly the sets at level $\Delta_1^0$ of the arithmetical hierarchy

Published on 28 Mar 2026 - 16:05

score 241 · Answer 3 · 2026-03-28 17:39:35

241

Views

Question about $\Sigma_n$-soundness

Published on 28 Mar 2026 - 17:39

score 544 · Answer 4 · 2012-12-05 01:39:47

544

Views

The set of Turing machines that recognize $\{00, 01\}$ is undecidable

Published on 05 Dec 2012 - 1:39

score 505 · Answer 5 · 2012-12-18 01:28:01

505

Views

Where does the input x in Turing Machine subroutines come from in solving reductions to undecidable problems?

Published on 18 Dec 2012 - 1:28

score 771 · Answer 6 · 2013-01-27 04:13:19

771

Views

Is the set of PA theorems the same as the set of solvable halting problems?

Published on 27 Jan 2013 - 4:13

score 556 · Answer 7 · 2013-01-31 20:32:29

556

Views

Explain why if the language A is recursive, then A is reducible to 01

Published on 31 Jan 2013 - 20:32

score 339 · Answer 8 · 2013-01-31 23:01:42

339

Views

Turing machines, halting problem

Published on 31 Jan 2013 - 23:01

score 438 · Answer 9 · 2013-02-04 14:46:29

438

Views

Are there known natural problems of intermediate degrees of unsolvability?

Published on 04 Feb 2013 - 14:46

score 554 · Answer 10 · 2026-02-23 10:16:55

554

Views

What turmite runs the longest before becoming predictable?

Published on 23 Feb 2026 - 10:16

score 210 · Answer 11 · 2013-02-19 00:11:04

210

Views

Where is the flaw in the following proof?

Published on 19 Feb 2013 - 0:11

score 1.1k · Answer 12 · 2013-02-19 01:40:41

1.1k

Views

Proving a language is Turing recognizable

Published on 19 Feb 2013 - 1:40

score 11.2k · Answer 13 · 2013-03-07 16:28:13

11.2k

Views

Proving that a Turing Machine that only accepts even length strings is undecidable

Published on 07 Mar 2013 - 16:28

score 100 · Answer 14 · 2013-03-15 09:22:34

100

Views

Prove or disprove: Superlanguages of Turing-recognizable languages are themselves Turing-recognizable.

Published on 15 Mar 2013 - 9:22

score 2.5k · Answer 15 · 2013-03-17 21:31:43

2.5k

Views

Why is showing a language is Turing recognizable trickier than showing Turing decidable?

Published on 17 Mar 2013 - 21:31

List Question

Seeking Alternate Proof Regarding Closure Of Recursively Enumerable Languages Under Shrink

I do not understand why the Turing computable sets of N are exactly the sets at level $\Delta_1^0$ of the arithmetical hierarchy

Question about $\Sigma_n$-soundness

The set of Turing machines that recognize $\{00, 01\}$ is undecidable

Where does the input x in Turing Machine subroutines come from in solving reductions to undecidable problems?

Is the set of PA theorems the same as the set of solvable halting problems?

Explain why if the language A is recursive, then A is reducible to 01

Turing machines, halting problem

Are there known natural problems of intermediate degrees of unsolvability?

What turmite runs the longest before becoming predictable?

Where is the flaw in the following proof?

Proving a language is Turing recognizable

Proving that a Turing Machine that only accepts even length strings is undecidable

Prove or disprove: Superlanguages of Turing-recognizable languages are themselves Turing-recognizable.

Why is showing a language is Turing recognizable trickier than showing Turing decidable?

Trending Questions

Popular # Hahtags

Popular Questions