home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.ai.neural-nets:3175 comp.ai:3079 comp.compression:3002 comp.theory:1753
- Newsgroups: comp.ai.neural-nets,comp.ai,comp.compression,comp.theory
- Path: sparky!uunet!cs.utexas.edu!sun-barr!ames!elroy.jpl.nasa.gov!forsight!gat
- From: gat@forsight.jpl.nasa.gov (Erann Gat)
- Subject: Re: measuring complexity (was Re: Kolmogorov Complexity)
- Message-ID: <1992Aug13.164527.15658@elroy.jpl.nasa.gov>
- Sender: news@elroy.jpl.nasa.gov (Usenet)
- Nntp-Posting-Host: robotics.jpl.nasa.gov
- Organization: Jet Propulsion Laboratory
- References: <1992Aug10.163725.26986@julian.uwo.ca> <1992Aug10.115352.1@acad3.alaska.edu> <1992Aug12.150857.219@access.digex.com>
- Date: Thu, 13 Aug 1992 16:45:27 GMT
- Lines: 21
-
- In article <1992Aug12.150857.219@access.digex.com> dzik@access.digex.com (Joseph Dzikiewicz) writes:
- >Actually, unless you have an assembly language that allows addressing
- >infinite memory, even an assembly language program has a finite
- >number of states (a large number, admittedly, but still finite).
-
- It has nothing to do with the language. Any assembly language can
- be used to control a tape drive (where have I heard that idea
- before?) Of course, tapes are finite - but wait! Let's build
- a tape drive with a tape-making machine attached to it. Of course,
- there is only a finite amount of raw material on the planet with
- which to make tape...
-
- My point is that the limiting factor on building a Turing Machine is
- the size of the Universe, not the design of an assembly language.
- Turing Machines are a convenient mathematical fiction which we use
- to model certain physical phenomena. The model is inaccurate at certain
- extremes, but so are most mathematical models of the world.
-
- Erann Gat
- gat@robotics.jpl.nasa.gov
-
-