Computing over the Reals: Foundations for Scientific Computing
计算复杂性
2007-05-23 v1 计算机科学中的逻辑
摘要
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 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.
引用
@article{arxiv.cs/0509042,
title = {Computing over the Reals: Foundations for Scientific Computing},
author = {Mark Braverman and Stephen Cook},
journal= {arXiv preprint arXiv:cs/0509042},
year = {2007}
}