Question

Find Pi number using Turing Machine

score 150 · Answer 1 · 2015-02-21 22:49:19

150

Views

Find Pi number using Turing Machine

Published on 21 Feb 2015 - 22:49

score 211 · Answer 2 · 2015-03-01 02:30:56

211

Views

Do there exist a pair of 'orthogonal' non-halting Turing machines?

Published on 01 Mar 2015 - 2:30

score 15.9k · Answer 3 · 2015-03-06 00:48:42

15.9k

Views

Showing that Turing-recognizable languages are closed under union

Published on 06 Mar 2015 - 0:48

score 4.7k · Answer 4 · 2015-03-06 02:08:36

4.7k

Views

How large is the set of all Turing machines?

Published on 06 Mar 2015 - 2:08

score 52 · Answer 5 · 2015-03-11 12:36:38

52

Views

Natural Numbers and $A_x=\{y \in A \mid y \leq x\}$

Published on 11 Mar 2015 - 12:36

score 259 · Answer 6 · 2026-03-25 17:24:57

259

Views

Application of wavelet analysis in computer science

Published on 25 Mar 2026 - 17:24

score 84 · Answer 7 · 2015-03-16 16:30:12

Show that every recursively enumerable set is accepted by a Turing machine with only two non accepting states and one accepting state.

score 76 · Answer 8 · 2015-03-21 20:47:59

76

Views

an strange set $ \Xi_A =$ {$ n \in N | \exists k^2 \in A $ s.t $ k^2 \leq n$} is decidable ?, an Interview questions?

Published on 21 Mar 2015 - 20:47

score 193 · Answer 9 · 2015-03-22 01:51:50

193

Views

Are there any known noncomputability proofs that do not rely on the halting problem?

Published on 22 Mar 2015 - 1:51

score 732 · Answer 10 · 2015-03-23 09:28:38

732

Views

How was the busy beaver candidate for 6 states calculated?

Published on 23 Mar 2015 - 9:28

score 193 · Answer 11 · 2015-04-10 17:24:37

193

Views

is differ between distributive lattice vs semi-lattice on Turing Degrees

Published on 10 Apr 2015 - 17:24

score 2.1k · Answer 12 · 2015-04-11 18:57:10

2.1k

Views

determining recognizable or decidable (TM that accepts a TM)

Published on 11 Apr 2015 - 18:57

score 48 · Answer 13 · 2015-04-19 16:34:46

48

Views

$ E_{\text{TM}} = \{ \langle M \rangle \mid L(M) = \varnothing \} $ is undecidable.

Published on 19 Apr 2015 - 16:34

score 68 · Answer 14 · 2015-04-21 14:52:32

68

Views

Computability: is there an alternative method to decide this language?

Published on 21 Apr 2015 - 14:52

score 3k · Answer 15 · 2015-04-28 11:44:34

3k

Views

What's the significance of the Church-Turing Thesis?

Published on 28 Apr 2015 - 11:44

List Question

Find Pi number using Turing Machine

Do there exist a pair of 'orthogonal' non-halting Turing machines?

Showing that Turing-recognizable languages are closed under union

How large is the set of all Turing machines?

Natural Numbers and $A_x=\{y \in A \mid y \leq x\}$

Application of wavelet analysis in computer science

Show that every recursively enumerable set is accepted by a Turing machine with only two non accepting states and one accepting state.

an strange set $ \Xi_A =$ {$ n \in N | \exists k^2 \in A $ s.t $ k^2 \leq n$} is decidable ?, an Interview questions?

Are there any known noncomputability proofs that do not rely on the halting problem?

How was the busy beaver candidate for 6 states calculated?

is differ between distributive lattice vs semi-lattice on Turing Degrees

determining recognizable or decidable (TM that accepts a TM)

$ E_{\text{TM}} = \{ \langle M \rangle \mid L(M) = \varnothing \} $ is undecidable.

Computability: is there an alternative method to decide this language?

What's the significance of the Church-Turing Thesis?

Trending Questions

Popular # Hahtags

Popular Questions