3 ms·
It actually can have some benefits -- a language without any unbounded loops or recursion isn't Turing-complete, but you do get a static guarantee of terminatio
by peter-fogg 14y ago
It actually can have some benefits -- a language without any unbounded loops or recursion isn't Turing-complete, but you do get a static guarantee of termination. NASA, for example, writes much of their C code only with bounded recursion. So they can't compute some things, but they can be sure that the Mars lander never gets stuck in an infinite loop.
- arianvanp 14y agohave you got any sources telling about this? I can't seem to find any. Would be a nice read
- Bjartr 14y agoHere's the official NASA JPL C coding standard http://lars-lab.jpl.nasa.gov/JPL_Coding_Standard_C.pdf http://lars-lab.jpl.nasa.gov/JPL_Coding_Standard_C.pdf Page 10 describes loop bounds and recursion limitations.