home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.ai.neural-nets:3186 comp.ai:3087 comp.compression:3008 comp.theory:1759
- Path: sparky!uunet!mcsun!uknet!axion!micromuse!exnet!dhd
- From: dhd@exnet.co.uk (Damon)
- Newsgroups: comp.ai.neural-nets,comp.ai,comp.compression,comp.theory
- Subject: Re: measuring complexity (was Re: Kolmogorov Complexity)
- Message-ID: <BsxrAq.5y7@exnet.co.uk>
- Date: 13 Aug 92 18:56:49 GMT
- References: <1992Aug10.163725.26986@julian.uwo.ca> <1992Aug10.115352.1@acad3.alaska.edu> <1992Aug12.150857.219@access.digex.com>
- Organization: ExNet Systems Ltd Public Access News, London, UK
- Lines: 24
-
- In article <1992Aug12.150857.219@access.digex.com> dzik@access.digex.com (Joseph Dzikiewicz) writes:
- >In article <1992Aug10.115352.1@acad3.alaska.edu> fxsdb@acad3.alaska.edu (Scott D. Berry) writes:
- >>an
- >>assembly language program, for example, may have an infinite number of states.
- >
- >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).
- >
- >This lack of infinite memory is why digital computers are of equal
- >computing power to a finite state machine and considerably less powerful
- >than a Turing machine. Admittedly, a computer with megabytes of memory
- ^^^^^^^^^^^^^^
- with an infinite tape (else the computer and the finite TM are equiv).
-
- >is a finite state machine with a lot of states, but it's still not
- >Turing-equivalent.
-
- Damon
- --
- Damon Hart-Davis | Tel/Fax: +44 81 755 0077 |1.22|| ALL MAIL FREE.
- Internet: dhd@exnet.co.uk | Also: Damon@ed.ac.uk || US hotrod motor groups.
- --------------------------+----------------------++ >12 mail&news polls / day.
- Public access UNIX (Suns), news and mail for #5 per month. FIRST MONTH FREE.
-