Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2representative citing papers
citing papers explorer
-
Feasibilism, Explication, and the Cobham-Edmonds Thesis
Presents analogous arguments supporting the Cobham-Edmonds thesis that feasible computation explicates to P.
- Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization