Computing over the Reals: Foundations for Scientific Computing

Details Computing over the Reals: Foundations for Scientific Computing Computing over the Reals: Foundations for Scientific Computing

2005-09-14

arxiv.org/abs/cs/0509042v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing over the Reals: Foundations for Scientific Computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing over the Reals: Foundations for Scientific Computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing over the Reals: Foundations for Scientific Computing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680093