There is supposedly a mechanical Turing machine built by a mathematican =
at the University of Heidelberg. (Noted in the Wikipedia article.)  I've =
searched around looking for it with no luck.  Anyone know where it is?  =
Altstadt? Neuenheim?


>=20
> First, a Turing Machine has a FINITE number of states and an
> infinite tape.
>=20
> Second a Turing Machine does one specific thing.  There is
> nothing that says
> a turing machine must be programmable.  You can define a Turing
> Machine M
> who's function is to read an encoding for another Turing Machine
> M' and then
> simulate M'.  In that case, M is a programmable Turing Machine.
> M' is also
> a Turing Machine.
>=20
> A simple machine is still a Turing Machine.
>=20
> Here http://plato.stanford.edu/entries/turing-machine/ is a
> brief definition
> of a Turing Machine.  Here's the wikipedia definition
> http://en.wikipedia.org/wiki/Turing_machine .  Here is a
> definition at
> Rutgers University:
> http://www.rci.rutgers.edu/~cfs/305_html/Intro/TuringEncodings.h
> tml .
>=20
> My simple machine fits the definition according to these sites.
>=20
> Amazing how you happen to know more about Turing Machines than
> professors at
> Stanford and Rutgers as well as every other univeristy in the
> world and even
> the public on wikipedia.
>=20
> I have studied Formal Languages which includes Turing Machines
> at the
> graduate level.
>=20
> Jason

---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.699 / Virus Database: 456 - Release Date: 6/4/2004
=20

--
http://www.piclist.com hint: PICList Posts must start with ONE topic:
[PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads