Turing Machine with faults, failures and recovery

Alex Vinokur

unread,

Jun 9, 2003, 11:56:54 PM6/9/03

to

"Alex Vinokur" <ale...@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]

==========================================
Alex Vinokur
mailto:ale...@connect.to
http://www.simtel.net/pub/oth/19088.html
http://sourceforge.net/users/alexvn
==========================================

Mikito Harakiri

unread,

Jun 10, 2003, 1:24:21 PM6/10/03

to

"Alex Vinokur" <ale...@bigfoot.com> wrote in message

news:bc3ku3$f3ubr$1...@ID-79865.news.dfncis.de...

>
> "Alex Vinokur" <ale...@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/

<quote>
Definition. 5-tape Expanded Turing Machine (with semi-infinite tapes)
corresponding to Turing Machine TM is 17-tuple
</quote>

Now, that's a formalism! (Never seen 17-tuple in math definition before;-)

BTW, I'm thinking replacing tape in my Turing machine. Is nylon or polyester
tape recomended today?

Alex Vinokur

unread,

Jun 11, 2003, 12:30:32 AM6/11/03

to

"Mikito Harakiri" <mikha...@ywho.com> wrote in message news:XBoFa.17$FT4...@news.oracle.com...

>
> "Alex Vinokur" <ale...@bigfoot.com> wrote in message
> news:bc3ku3$f3ubr$1...@ID-79865.news.dfncis.de...
> >
> > "Alex Vinokur" <ale...@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/
>
> <quote>
> Definition. 5-tape Expanded Turing Machine (with semi-infinite tapes)
> corresponding to Turing Machine TM is 17-tuple
> </quote>
>
> Now, that's a formalism! (Never seen 17-tuple in math definition before;-)
>

[snip]

What about 21-tuple and 25-tuple ? See
http://www.bell-labs.com/user/rjh/pubs/am/amieee.ps.gz (Page 7)
http://www.cs.umass.edu/~immerman/pub/bis.ps (page 12),
http://www-ab.informatik.uni-tuebingen.de/teaching/ss02/bioinformatik2/abi2/aufgaben/blatt9.ps (Page 1)

Mikito Harakiri

unread,

Jun 11, 2003, 11:59:38 AM6/11/03

to

"Alex Vinokur" <ale...@bigfoot.com> wrote in message

news:bc6b9a$g3j12$1...@ID-79865.news.dfncis.de...

> What about 21-tuple and 25-tuple ? See
> http://www.bell-labs.com/user/rjh/pubs/am/amieee.ps.gz (Page 7)
> http://www.cs.umass.edu/~immerman/pub/bis.ps (page 12),

It is not math, it's CS:-) And it's actually 5*5 tuple (matrix?)

Alex Vinokur

unread,

Oct 21, 2004, 4:32:36 AM10/21/04

to

Alex Vinokur wrote in message
http://groups.google.com/groups?selm=bc3ku3%24f3ubr%241%40ID-79865.news.dfncis.de

> "Alex Vinokur" <ale...@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