Date: 10/02/06 (Algorithms)    Keywords: html, google

In contrast to practical situation an ordinary Turing Machine never
fails.
An attempt to describe some Turing Machine that may fail was made.
Here is brief description of
* Turing Machine with faults, failures and recovery
http://arxiv.org/abs/cs/0410051
and
* its C++ Simulator (Beta version).
http://sourceforge.net/projects/turing-machine/
http://alexvn.freeservers.com/s1/turing-s.html
http://groups.google.ca/groups?hl=en&lr=&threadm=b4p5pt%2422nsld%241%40ID-79865.news.dfncis.de

Source: http://community.livejournal.com/algorithms/84180.html