|
|
|
| Authored by: jesse on Monday, June 11 2012 @ 05:29 AM EDT |
Basic Taylor series for computing trigonometric functions is infinite...
How far you go is up to the needs of the problem.[ Reply to This | Parent | # ]
|
| |
| Authored by: Anonymous on Monday, June 11 2012 @ 06:06 AM EDT |
It can also be shown that software that may run into into infinite
loops is also isomorphic to Turing machines. Partial recursive functions and
lambda-calculus and Turing machines are all models of computations that may run
into infinite loops and this is part of the same series of theorems of
computation theory you allude to.
Not having studied computation
theory or anything close, would the same apply to software that is
deliberately one or more infinite loops (or repeatedly called via
interrupts)? I am thinking of embedded software of which we have so much these
days. A trivial example of what I am thinking about would be the software that
runs your microwave oven. I.e., it's not ever expected to "return an answer"
but it does continually do things (monitor for key presses, display digits,
control hardware, etc).[ Reply to This | Parent | # ]
|
- Question - Authored by: PolR on Monday, June 11 2012 @ 08:52 AM EDT
|
|
|
|
