home *** CD-ROM | disk | FTP | other *** search
- Xref: sparky comp.ai.neural-nets:3193 comp.ai:3095 comp.compression:3014 comp.theory:1764
- Newsgroups: comp.ai.neural-nets,comp.ai,comp.compression,comp.theory
- Path: sparky!uunet!s5!sethb
- From: sethb@fid.morgan.com (Seth Breidbart)
- Subject: Re: measuring complexity (was Re: Kolmogorov Complexity)
- Message-ID: <1992Aug14.170728.14162@fid.morgan.com>
- Organization: Morgan Stanley & Co., New York, NY
- References: <arms.713549466@spedden> <1992Aug12.173546.3298@access.usask.ca> <1992Aug13.033835.4492@linus.mitre.org>
- Date: Fri, 14 Aug 1992 17:07:28 GMT
- Lines: 17
-
- In article <1992Aug13.033835.4492@linus.mitre.org>
- crawford@church.mitre.org (Randy Crawford) writes:
-
- >That begs a question. Are all universal turing machines of indeterminate
- >power? Or must they be considered turing machines because they _may_ be
- >configured as turing machines, even though they also may not be so configured?
- >If they _are_ still turing machines, then once again, why does computibility
- >theory become uninteresting once a turing machine is passed instructions?
-
- A Universal Turing Machine is a Turing Machine that, on input <i,j>,
- returns the same result as Turing Machine i does on input j.
- Therefore, Universal Turing Machines are a subset of Turing Machines.
- There can be Universal Machines that start out more powerful than
- Turing Machines but this particular one is programmed to act like a
- Universal Turing Machine.
-
- Seth sethb@fid.morgan.com
-