Theoretical Computer Science Stack Exchange

Score of 2

2 answers

457 views

Isn't it misleading for Scala 3 to claim it has dependent function types?

Patrick Nicodemus

reputation score 121

modified 8 hours ago

Score of 41

2 answers

2911 views

Importance of single author papers?

Guest

reputation score 1

answered Jul 3 at 21:01

Score of 24

3 answers

1823 views

Decidability of diophantine equations over {=, +, gcd}

Bartosz Jan Bednarczyk

reputation score 1566

modified Jul 2 at 7:15

Score of 0

0 answers

128 views

Is my algorithm FPT if parameters grow with $n$?

J. Schmidt

reputation score 285

asked Jun 28 at 0:12

Score of 3

1 answer

122 views

Normalization by evaluation for system T

Andrej Bauer

reputation score 30182

modified Jun 26 at 8:37

Score of 7

2 answers

835 views

Does there exist a predictor that eventually predicts every computable binary sequence?

Denis

reputation score 9729

modified Jun 25 at 23:27

Score of 0

0 answers

74 views

how to show that the number of arranging tiles is #P-complete

user1720967

reputation score 1

asked Jun 25 at 10:33

Score of 2

2 answers

293 views

Show that the first agent weakly prefers their own bundle to anybody else's

CommunityBot

reputation score 1

modified Jun 19 at 21:07

Score of 8

1 answer

240 views

Partial word completions with a factor compatible with another partial word

Antoine Amarilli 'a3nm'

reputation score 11567

modified Jun 16 at 14:09

Score of 5

1 answer

117 views

Non-emptiness problem for Two-Way Alternating Parity Tree Automaton modulo a certain safety condition

Yendreque

reputation score 26

answered Jun 14 at 21:31

Score of 2

0 answers

76 views

A confusion in a proof of shrinkage exponent of de Morgan formulae of Hastad

minh quý lê

reputation score 171

asked Jun 14 at 15:43

Score of -1

1 answer

159 views

Computability Theory analogy of PSPACE

Noah Schweber

reputation score 669

answered Jun 14 at 1:51

Score of 6

1 answer

310 views

Is this problem in P? Given a bipartite graph, find a minimum cardinality set of edges which intersect every vertex cover

Mikhail Rudoy

reputation score 2963

answered Jun 13 at 11:06

Score of 1

0 answers

25 views

What rule features form persistent hierarchical structures in cellular automata?

Lance Pollard

reputation score 151

asked Jun 13 at 8:30

Stack Exchange Network

Explore our questions

Isn't it misleading for Scala 3 to claim it has dependent function types?

Importance of single author papers?

Decidability of diophantine equations over {=, +, gcd}

Is my algorithm FPT if parameters grow with $n$?

Normalization by evaluation for system T

Does there exist a predictor that eventually predicts every computable binary sequence?

how to show that the number of arranging tiles is #P-complete

Show that the first agent weakly prefers their own bundle to anybody else's

Partial word completions with a factor compatible with another partial word

Non-emptiness problem for Two-Way Alternating Parity Tree Automaton modulo a certain safety condition

A confusion in a proof of shrinkage exponent of de Morgan formulae of Hastad

Computability Theory analogy of PSPACE

Is this problem in P? Given a bipartite graph, find a minimum cardinality set of edges which intersect every vertex cover

What rule features form persistent hierarchical structures in cellular automata?

Hot Network Questions