Question

What can we say a language is recursively enumerable if it can be simulated?

score 76 · Answer 1 · 2017-03-08 16:52:24

76

Views

What can we say a language is recursively enumerable if it can be simulated?

Published on 08 Mar 2017 - 16:52

score 169 · Answer 2 · 2017-03-09 01:12:41

169

Views

Non recursive set that intersects every recursively enumerable set

Published on 09 Mar 2017 - 1:12

score 161 · Answer 3 · 2017-03-10 05:46:04

Is the problem of answering the “Does [a random, but computable irrational number] contain all finite sequences of digits?" question computable?

score 404 · Answer 4 · 2017-03-11 04:42:31

404

Views

Index sets property (computability theory)

Published on 11 Mar 2017 - 4:42

score 1k · Answer 5 · 2017-03-11 22:03:22

1k

Views

Ackermann function $A(x,y)$: Prove that $A(4,y) = \underbrace{2^{2^{.^{\cdot^2}}}}_\textrm{y+3 times} -3$.

Published on 11 Mar 2017 - 22:03

score 186 · Answer 6 · 2017-03-14 01:04:44

186

Views

Is partitioning a multiset, M, into two equal subsets equivalent to partitioning (M $\cup$ M) into four equal subsets?

Published on 14 Mar 2017 - 1:04

score 1.2k · Answer 7 · 2017-03-14 04:49:55

1.2k

Views

Can every partially computable function be extended to a total computable function?

Published on 14 Mar 2017 - 4:49

score 365 · Answer 8 · 2026-03-24 23:41:51

365

Views

Pairing in Presburger arithmetic

Published on 24 Mar 2026 - 23:41

score 353 · Answer 9 · 2026-03-26 22:13:22

353

Views

L is decidable. Prove that “similar” language is also decidable

Published on 26 Mar 2026 - 22:13

score 335 · Answer 10 · 2017-03-21 02:32:53

335

Views

Connections between mathematical logic and theoretical computer science

Published on 21 Mar 2017 - 2:32

score 339 · Answer 11 · 2017-03-21 17:24:43

339

Views

Prove that PTIME has no complete problems with respect to linear-time reductions.

Published on 21 Mar 2017 - 17:24

score 1k · Answer 12 · 2017-03-21 20:10:01

1k

Views

Show that PTIME and PSPACE is closed under Klenee star

Published on 21 Mar 2017 - 20:10

score 428 · Answer 13 · 2017-03-22 18:16:26

428

Views

Show that if $L$ is recursively enumerable (RE) then $L$ is the domain of some partial computable function

Published on 22 Mar 2017 - 18:16

score 482 · Answer 14 · 2017-03-23 22:22:16

482

Views

Show that $X\subseteq \mathbb{N}$ is computably enumerable iff it is the image of a computable function

Published on 23 Mar 2017 - 22:22

score 1.2k · Answer 15 · 2026-03-26 22:17:54

1.2k

Views

A one-tape Turing machine which operates in linear time can only recognize a regular language

Published on 26 Mar 2026 - 22:17

List Question

What can we say a language is recursively enumerable if it can be simulated?

Non recursive set that intersects every recursively enumerable set

Is the problem of answering the “Does [a random, but computable irrational number] contain all finite sequences of digits?" question computable?

Index sets property (computability theory)

Ackermann function $A(x,y)$: Prove that $A(4,y) = \underbrace{2^{2^{.^{\cdot^2}}}}_\textrm{y+3 times} -3$.

Is partitioning a multiset, M, into two equal subsets equivalent to partitioning (M $\cup$ M) into four equal subsets?

Can every partially computable function be extended to a total computable function?

Pairing in Presburger arithmetic

L is decidable. Prove that “similar” language is also decidable

Connections between mathematical logic and theoretical computer science

Prove that PTIME has no complete problems with respect to linear-time reductions.

Show that PTIME and PSPACE is closed under Klenee star

Show that if $L$ is recursively enumerable (RE) then $L$ is the domain of some partial computable function

Show that $X\subseteq \mathbb{N}$ is computably enumerable iff it is the image of a computable function

A one-tape Turing machine which operates in linear time can only recognize a regular language

Trending Questions

Popular # Hahtags

Popular Questions