38

Answers
votes newest views recent
1
Succinctly naming big numbers: ZFC versus Busy-Beaver
3
What was Gödel’s real achievement?
2
The best text to study both incompleteness theorems
2
Solving NP problems in (usually) Polynomial time?
11
Where to publish a paper on the Mafia game?
3
Lower Bounds in Theoretical Computer Science
4
What is the time complexity of computing sin(x) to t bits of precision?
3
Is there a general setting for self-reference?
2
Most ‘obvious’ open problems in complexity theory
7
Structure theorems for Turing-decidable languages?
10
Interpretation of the Second Incompleteness Theorem
2
Difference between turnstile and implication
3
Propositions equivalent to the completeness of the real numbers
5
How would calculus be possible in a finitist axiom system?
4
Don’t the axioms of set theory implicitly assume numbers?
2
Completeness, easiest, hardest problems
2
Wolfram’s 2-state 3-symbol Turing machine
1
A programming language that can only create algorithms with polynomial runtime?
2
Why can Diophantine equations represent exponential growth?
6
Non-constructive proofs vs. efficient algorithms
2
All properties of a mathematical object
2
Is the Axiom of Union independent of the rest of ZF?
0
Effectively closed computable functions
1
Do all uncountable sets contain elements with infinite Kolmogorov complexity?
2
Computable nonstandard models for weak systems of arithemtic
2
Are computable models sufficient?
1
truth vs. provability for ordered fields
9
Descriptive complexity theoretic-characterizations of P and NP
4
Definition of relativization of complexity class
2
Derivability conditions for Robinson arithmetic
1 2 next