Computing over the Reals: Foundations for Scientific Computing

Simple item page
dc.creatorBraverman, Mark
dc.creatorCook, Stephen
dc.date2005-09-14
dc.date.accessioned2026-07-07T03:23:27Z
dc.date.available2026-07-07T03:23:27Z
dc.descriptionWe 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 of scientific computation. In the introduction we also discuss the alternative Blum-Shub-Smale model. In the final section we discuss the issue of whether physical systems could defeat the Church-Turing Thesis.
dc.identifierhttps://arxiv.org/abs/cs/0509042
dc.identifierhttp://arxiv.org/abs/cs/0509042
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32944
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.subjectF.1.1; G.0
dc.titleComputing over the Reals: Foundations for Scientific Computing
dc.typetext

Files

Collections

arXiv