*To*: Wang Zirui <zirui at nus.edu.sg>*Subject*: Re: [isabelle] Formalizing Turing machine*From*: Alexander Krauss <krauss at in.tum.de>*Date*: Wed, 30 Sep 2009 10:32:24 +0200*Cc*: isabelle-users at cl.cam.ac.uk*In-reply-to*: <fb295f280909290239k28b8ce6fm1693af3d26781795@mail.gmail.com>*References*: <fb295f280909290239k28b8ce6fm1693af3d26781795@mail.gmail.com>*User-agent*: Mozilla-Thunderbird 2.0.0.22 (X11/20090701)

Deac Zirui,

I'd like to formalize the definition of Turing machine. If possible, I'd like to do it without relying on ZFC. That is, I don't use sets, integers and so on.

[...] So if you agree with me and think it's possible to go without sets, could you please outline how to define Turing machine?

http://afp.sourceforge.net/entries/Functional-Automata.shtml It's not Turing Machines, but it may give you an idea... Alex

**Follow-Ups**:**Re: [isabelle] Formalizing Turing machine***From:*Wang Zirui

**Re: [isabelle] Formalizing Turing machine***From:*Richard Waldinger

**References**:**[isabelle] Formalizing Turing machine***From:*Wang Zirui

- Previous by Date: Re: [isabelle] Isabelle 2007 -> Isabelle 2009
- Next by Date: Re: [isabelle] Isabelle 2007 -> Isabelle 2009
- Previous by Thread: [isabelle] Formalizing Turing machine
- Next by Thread: Re: [isabelle] Formalizing Turing machine
- Cl-isabelle-users September 2009 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list