Computing with real numbers
September 15th, 2005 by WaltI just spotted an interesting paper on Arxiv: Computing over the Reals: Foundations for Scientific Computing, which suggests a new model of computation with real numbers.
I just spotted an interesting paper on Arxiv: Computing over the Reals: Foundations for Scientific Computing, which suggests a new model of computation with real numbers.
September 16th, 2005 at 2:26 pm
I couldn’t figure out what was new about their model of computation. Do you have an explanation?
September 16th, 2005 at 8:32 pm
I looked at the paper more closely today, and it’s not very impressive. It seems like an introduction to their preferred approach, and not anything particularly new.
September 17th, 2005 at 10:02 am
A more interesting approach, IMHO, is to use lazy evaluation to compute as many digits as required.
September 19th, 2005 at 6:57 am
I think from a theoretical point of view their approach is equivalent to the lazy evaluation approach. Their contrasting with a different model of computation where you can do real arithmetic with infinite precision.
September 20th, 2005 at 11:54 am
While I’ve just started reading this, I think it probably merits some attention, especially because of the pedigree of the author (Stephen Cook - NP completeness)