Re: Turing Machine to Train Sets Converter
From: André Betz (mail_at_andrebetz.de)
Date: 10/26/04
- Next message: Mike Oliver: "Re: (Not quite) Cantor's diagonal proof"
- Previous message: Virgil: "Re: (Not quite) Cantor's diagonal proof"
- In reply to: Alex Vinokur: "Re: Turing Machine to Train Sets Converter"
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 26 Oct 2004 22:24:54 +0200
Alex Vinokur wrote:
> Could you give some information about Chalcraft Train Sets according to article
> D.A. Chalcraft and M.T. Greene. Train sets. Eureka, 53:5--12, 1994 ?
>
> Could you also give some example how your program works?
> What is input (with simple sample)?
> What is output?
> What is computational process?
>
> Thanks,
Hi Alex,
in the Zipfile there is a file Demo.tm which demonstrate the
transformation. The Output is a *.pgm File which could be shown with
many picture viewers.
There is also a help fail about the different functional rails used
(e.g. Lazy switch, Sprung and FlipFlop).
Demo.tm:
# First State, Tapeposition to begin
(1,1)
# the Tape (only two symbols: t:true, f:false)
(fft)
# transitionen
# (actual State, read symbol,next state,write,move direction)
(1,t,1,f,L) (1,f,1,f,R)
(2,t,3,t,R) (2,f,2,f,L)
(3,t,3,t,R) (3,f,2,f,L)
The Converter itself doesn't make any computation itself it only
transforms it to the line section.
I hope this will help a little bit.
André Betz
http://www.andrebetz.de
- Next message: Mike Oliver: "Re: (Not quite) Cantor's diagonal proof"
- Previous message: Virgil: "Re: (Not quite) Cantor's diagonal proof"
- In reply to: Alex Vinokur: "Re: Turing Machine to Train Sets Converter"
- Messages sorted by: [ date ] [ thread ]