Re: [isabelle] Formalizing Turing machine



Churchs' thesis says, that all computability can be expressed by Turing machines. So you probably cannot bypass sets when defining a such a formalism. Mathematically spoken do groups, rings, (closed) fields rely on sets in their definition. Also alphabets are sets. What do you have on mind?
Jens


begin:vcard
fn:Jens Doll
n:Doll;Jens
org:Context IT GmbH
adr:;;PO 1616;Ahrensburg;SH;22906;Deutschland
title;quoted-printable:Gesch=C3=A4ftsf=C3=BChrer
note:Handelsregister HRB 7951 HL
url:www.cococo.de
version:2.1
end:vcard



This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.