Path: utzoo!attcan!uunet!aplcen!samsung!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!unix.cis.pitt.edu!dsinc!netnews.upenn.edu!king.mcs.drexel.edu!jsmith
From: jsmith@king.mcs.drexel.edu (Justin Smith)
Newsgroups: comp.ai
Subject: Artificial vs. ''real'' intelligence
Message-ID: <1990Jul11.152007.7225@king.mcs.drexel.edu>
Date: 11 Jul 90 15:20:07 GMT
Organization: Drexel University, Dept. of Math. and Comp. Sci.
Lines: 12

In article <TIM.90Jul7140549@watt.cstr.ed.ac.uk>, tim@cstr.ed.ac.uk (Tim Bradsha
w) writes:
> I have a paper by Deutch where he proves something he
> calls the `physical Church-Turing principle':
>
>    Every finitely realizable physical system can be perfectly
>    simulated by a universal model computing machine operating by
>    finite means.
>

The key element here is ''finitely realizable''.  There is no reason
to assume that ''finitely realizable'' physical systems exist!