Theoretical Computer Science Stack Exchange

0 votes

0 answers

5 views

Smallest 2-symbols Turing machine that can decide primality using unary encoding

Cristian Gratie

161

asked 4 hours ago

1 vote

0 answers

14 views

Formula complexity of `n = 0 mod m`

Nicola Gigante

1,690

asked 5 hours ago

0 votes

0 answers

30 views

Nonexistence of short integer program sequence which generates squares

Turbo

13.1k

asked 10 hours ago

0 votes

1 answer

59 views

Time complexity of square root floor

Emil Jeřábek

18k

answered 19 hours ago

0 votes

0 answers

46 views

Complexity of choosing a set of movies, one from each year, with disjoint actors?

TLss

1

modified yesterday

2 votes

2 answers

108 views

Can a RAM machine with polynomial memory be simulated by a multi-tape Turing machine without extra time or space costs?

ULechine

331

modified yesterday

0 votes

0 answers

34 views

NP-completeness of Nested Flexible Machine Scheduling with summaric job completion time

Mich Szyfel

1

modified yesterday

0 votes

0 answers

30 views

Integration of analytic function

D.W.

12.2k

modified 2 days ago

3 votes

1 answer

130 views

References for $\mathsf{PSPACE} \neq \mathsf{E}$ and $\mathsf{P} \neq \mathsf{NTIME}(n^k)$

Eric Allender

2,251

answered 2 days ago

5 votes

1 answer

227 views

Complexity of finding graph automorphism group vs. canonization

Joshua Grochow

37.8k

answered 2 days ago

17 votes

1 answer

474 views

Strongly Regular Graph and GI-Completeness

Joshua Grochow

37.8k

modified Jul 22 at 16:38

3 votes

1 answer

77 views

Is $D_\infty$ a universal domain?

Andrej Bauer

29.3k

modified Jul 22 at 8:42

18 votes

4 answers

4k views

What would be the consequences of $\mathsf{PH=PSPACE}$?

Misha Brukman

107

modified Jul 21 at 23:53

1 vote

1 answer

89 views

Are Turing Machines Models?

Beniamino Accattoli

411

answered Jul 21 at 23:19

Stack Exchange Network

Explore our questions

Smallest 2-symbols Turing machine that can decide primality using unary encoding

Formula complexity of `n = 0 mod m`

Nonexistence of short integer program sequence which generates squares

Time complexity of square root floor

Complexity of choosing a set of movies, one from each year, with disjoint actors?

Can a RAM machine with polynomial memory be simulated by a multi-tape Turing machine without extra time or space costs?

NP-completeness of Nested Flexible Machine Scheduling with summaric job completion time

Integration of analytic function

References for $\mathsf{PSPACE} \neq \mathsf{E}$ and $\mathsf{P} \neq \mathsf{NTIME}(n^k)$

Complexity of finding graph automorphism group vs. canonization

Strongly Regular Graph and GI-Completeness

Is $D_\infty$ a universal domain?

What would be the consequences of $\mathsf{PH=PSPACE}$?

Are Turing Machines Models?

Hot Network Questions