2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32944We 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.Computational ComplexityLogic in Computer ScienceF.1.1; G.0text