Hi Herbert, On Sat, Apr 24, 2004 at 09:41:01AM +1000, Herbert Xu wrote: > Given any Turing machine M there is a Turing machine N that turns its > input s and writes out a new Turing machine M' that is equivalent to > M operating with s as the input. > > This gives you a mapping (realised using N) from the set of finite strings > to the set of Turing machines. Oh, I see, very useful concept ;-) Thank you for the explanation, Jochen -- http://seehuhn.de/
Attachment:
signature.asc
Description: Digital signature