Xref: utzoo comp.ai:2837 talk.philosophy.misc:1698
Path: utzoo!utgpu!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!bloom-beacon!bu-cs!mirror!rayssd!raybed2!linus!mbunix!bwk
From: bwk@mitre-bedford.ARPA (Barry W. Kort)
Newsgroups: comp.ai,talk.philosophy.misc
Subject: Re: Artificial Intelligence and Intelligence
Summary: Knowledge and Foreknowledge
Keywords: random? oh no!
Message-ID: <42569@linus.UUCP>
Date: 8 Dec 88 02:52:35 GMT
References: <484@soleil.UUCP> <0XTukNy00Xol41W1Ui@andrew.cmu.edu> <42328@linus.UUCP> <1069@microsoft.UUCP> <180@loligo.fsu.edu>
Sender: news@linus.UUCP
Reply-To: bwk@mbunix (Barry Kort)
Organization: Neurotic Netware, Dendrite Faults, NV
Lines: 11

In article <180@loligo.fsu.edu> pepke@loligo.UUCP (Eric Pepke) writes:
 > A random number generator can only be consulted a finite number of
 > times in a lifetime.  For every finite sequence of such random numbers,
 > you can produce a partial Turing machine specification which produces
 > that sequence.  So, there's no problem.

Just one problem, Eric.  You have to build your Turing Machine
emulator before I have finished living my life.  The information
you need to construct it is not available just yet.

--Barry Kort