Computer Science Stack Exchange

1 vote

1 answer

46 views

What are the differences between Oracle Turing Machine and PAC?

complexity-theory turing-machines oracle-machines

CommunityBot

1

modified 9 hours ago

1 vote

2 answers

43 views

Why is $A_{TM}$ not mapping reducible to $E_{TM}$?

turing-machines reductions undecidability

user2277550

255

modified yesterday

0 votes

1 answer

81 views

Copy operation in under 9 states?

finite-automata turing-machines

CommunityBot

1

modified May 16 at 23:05

2 votes

1 answer

113 views

Disprove: if L is decidable then Prefix(L) is decidable

turing-machines undecidability halting-problem check-my-answer

John L.

33k

modified May 16 at 21:01

9 votes

1 answer

2k views

Compiler that compiles to a Turing machine?

turing-machines compilers

CommunityBot

1

modified May 16 at 17:02

2 votes

2 answers

53 views

Is the problem of "DFA-TM-INCLUSION" recursively enumerable?

turing-machines computability finite-automata reductions recursively-enumerable

John L.

33k

modified May 16 at 13:21

1 vote

2 answers

48 views

Since there is no such thing as infinite memory, can we say that all pushdown automata and Turing machines are actually very big DFA?

complexity-theory turing-machines finite-automata pushdown-automata

Hendrik Jan

27.2k

answered May 15 at 19:37

1 vote

0 answers

20 views

Showing that $ASPACE(f (n)) = DTIME(2^{O(f (n))})$

complexity-theory turing-machines

Yuval Filmus

269k

modified May 15 at 18:29

0 votes

0 answers

30 views

Translate det. Turingmachine into formula

turing-machines nondeterminism

heythere

11

modified May 14 at 15:13

0 votes

0 answers

13 views

Left and right derivation of Turing Machine

turing-machines derivation

Miguel JV

3

asked May 13 at 0:30

0 votes

1 answer

18 views

Construction of a Turing Machine that accepts the language of (a^nb^nc^md^m for) m,n >= 1

turing-machines context-free

Rick Decker

14.5k

answered May 12 at 23:28

0 votes

1 answer

51 views

kolmogorov complexity for finite Language?

formal-languages turing-machines programming-languages turing-completeness kolmogorov-complexity

CommunityBot

1

modified May 12 at 18:04

1 vote

1 answer

87 views

Language of Turing machines that go through some configuration infinitely many times on empty input

formal-languages turing-machines semi-decidability decidability

John L.

33k

modified May 11 at 18:59

1 vote

1 answer

66 views

Constant-time adding an element?

complexity-theory turing-machines polynomial-time memory-allocation

CommunityBot

1

modified May 11 at 12:07

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

What are the differences between Oracle Turing Machine and PAC?

Why is $A_{TM}$ not mapping reducible to $E_{TM}$?

Copy operation in under 9 states?

Disprove: if L is decidable then Prefix(L) is decidable

Compiler that compiles to a Turing machine?

Is the problem of "DFA-TM-INCLUSION" recursively enumerable?

Since there is no such thing as infinite memory, can we say that all pushdown automata and Turing machines are actually very big DFA?

Showing that $ASPACE(f (n)) = DTIME(2^{O(f (n))})$

Translate det. Turingmachine into formula

Left and right derivation of Turing Machine

Construction of a Turing Machine that accepts the language of (a^nb^nc^md^m for) m,n >= 1

kolmogorov complexity for finite Language?

Language of Turing machines that go through some configuration infinitely many times on empty input

Constant-time adding an element?

Hot Network Questions