Skip to main content
The 2026 Annual Developer Survey is live— take the Survey today!.

Explore our questions

Score of -3
0 answers
89 views

Can the contrast between 2‑SAT and 3‑SAT in linear logic be turned into a proof of P ≠ NP?

Score of 0
0 answers
89 views

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

Score of 3
1 answer
111 views

Normalization by evaluation for system T

Score of 7
2 answers
815 views

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

Score of 0
0 answers
63 views

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

Score of 2
2 answers
292 views

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

Score of 8
1 answer
238 views

Partial word completions with a factor compatible with another partial word

Score of 24
3 answers
1775 views

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

Score of 5
1 answer
112 views

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

Score of 1
0 answers
72 views

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

Score of -1
1 answer
148 views

Computability Theory analogy of PSPACE

Score of 6
1 answer
303 views

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

Score of 1
0 answers
24 views

What rule features form persistent hierarchical structures in cellular automata?

Score of 9
1 answer
575 views

Decidable fragment of second-order logic

Browse more Questions