Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Formal languages and their relation to automata
Formal languages and their relation to automata
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
Undecidability and incompleteness results in automata theory
A half-century of automata theory
Security for Distributed E-Service Composition
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
The complexity of parameter passing in polymorphic procedures
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Relations between diagonalization, proof systems, and complexity gaps
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Some connections between mathematical logic and complexity theory
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A programming language theorem which is independent of Peano Arithmetic
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The consistency of "P = NP" and related problems with fragments of number theory
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Independence results in Computer Science? (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On a class of independent problems related to Rice theorem
ACM SIGACT News
| Hi-index | 0.00 |
In this note we show that instances of problems which appear naturally in computer science cannot be answered in formalized set theory. We show, for example, that some relativized versions of the famous P = NP problem cannot be answered in formalized set theory, that explicit algorithms can be given whose running time is independent of the axioms of set theory, and that one can exhibit a specific context-free grammar G for which it cannot be proven in set theory that L(G) = Σ* or L(G) ≠ Σ*.