50 citations · 50 across the 2 of their papers we have counts for
2 papers
cs.CC2005★ 50 cited
Computing over the Reals: Foundations for Scientific Computing
Mark Braverman, Stephen Cook
We give a detailed treatment of the ``bit-model'' of computability and complexity of real functions and subsets of R^n, and argue that this is a good way to formalize many problems…
cs.LO2004
The strength of replacement in weak arithmetic
Stephen Cook, Neil Thapen
The replacement (or collection or choice) axiom scheme asserts bounded quantifier exchange. We prove the independence of this scheme from various weak theories of arithmetic, somet…