Stephen Wolfram's: A New Kind of Science | Online
Jump to Page
Look Up in Index

Chapter 12 Notes > Section 4 > Page 1129 > Note (c) Previous note-----Next note
Notes for: The Principle of Computational Equivalence | The Validity of the Principle

*[Universality in] equations

For any purely algebraic equation involving real numbers it is possible to find a bound on the size of any isolated solutions it has, and then to home in on their actual values. But as discussed on page 786, nothing similar is true for equations involving only integers, and in this case finding solutions can in effect require following the evolution of a system like a cellular automaton for infinitely many steps. If one allows trigonometric functions, any equation for integers can be converted to one for real numbers; for example x^2+y^2==z^2 for integers is equivalent to Sin[Pi x]^2 + Sin[Pi y]^2 +Sin[Pi z]^2 + (x^2+y^2-z^2)^2==0 for real numbers.


Page image


Pages related to this note:


All notes on this page:

* Continuous computation
* Initial conditions [and continuity]
* Constructible reals
* [Universality in] equations
* [Time compression in] ODEs
* Emulating discrete systems [with continuous ones]
* All notes for this section
* Downloadable programs for this page
* Downloadable images
* Search Forum for this page
* Post a comment
* NKS | Online FAQs
From Stephen Wolfram: A New Kind of Science [citation] Previous note-----Next note