Re: Turing Machine with faults, failures and recovery
From: Alex Vinokur (alexvn_at_big-foot.com)
Date: 10/21/04
- Previous message: John P. Green: "Re: Another claim for P=NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 21 Oct 2004 10:32:36 +0200
Alex Vinokur wrote in message
http://groups.google.com/groups?selm=bc3ku3%24f3ubr%241%40ID-79865.news.dfncis.de
> "Alex Vinokur" <alexvn@bigfoot.com> wrote in message news:b4qm4h$235suj$1@ID-79865.news.dfncis.de...
> >
> > 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
> > and
> > * its C++ Simulator (Beta version).
> > http://alexvn.freeservers.com/s1/turing-s.html
> > http://groups.google.com/groups?th=738ab622a7586f42
> >
>
> Also : http://sourceforge.net/projects/turing-machine/
[snip]
Also e-print at ArXiv: http://arxiv.org/abs/cs/0410051
--
Alex Vinokur
email: alex DOT vinokur AT gmail DOT com
http://mathforum.org/library/view/10978.html
http://sourceforge.net/users/alexvn
- Previous message: John P. Green: "Re: Another claim for P=NP"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|