Re: Machines was:Kim 2.1

2008-12-26 Thread Stathis Papaioannou
2008/12/26 Günther Greindl guenther.grei...@gmail.com wrote: And this assumption is quite close to comp in the sense that nobody knows about any natural machine not being turing emulable. Even quantum machine, accepting QM without collapse. That is true, but we have to be careful in our

Re: Machines was:Kim 2.1

2008-12-26 Thread Bruno Marchal
Hi Günther, On 25 Dec 2008, at 20:01, Günther Greindl wrote: Bruno, This conception can, I think, be indeed taken for granted by every scientifically minded person. Why ? It is an assumption too. What could we taken it for granted? Yes, it is an assumption - that is why is wrote

Re: Machines was:Kim 2.1

2008-12-26 Thread Bruno Marchal
On 25 Dec 2008, at 20:10, Günther Greindl wrote: Bruno, But no weakening of comp based on nature is known to escape the replicability. Even the non cloning theorem in QM cannot be used to escape the UDA conclusion. I already wanted to ask you on this one: you have said before on the

Re: Machines was:Kim 2.1

2008-12-26 Thread Bruno Marchal
On 25 Dec 2008, at 22:27, Kim Jones wrote: On 26/12/2008, at 5:23 AM, Bruno Marchal wrote: On 25 Dec 2008, at 08:05, Abram Demski wrote: Bruno, I agree with Gunther about the two types of machine. The broader machine is any system that can be logically described-- a system that

Re: Machines was:Kim 2.1

2008-12-26 Thread Abram Demski
Bruno, In one sense those examples are things for which (finite) reasoning fails, but I would still say that they are governed by (finite) rules and possess a (finite) description-- the problem is merely that it takes infinite amounts of time to derive the consequences of those

Re: Machines was:Kim 2.1

2008-12-26 Thread Abram Demski
Bruno, Thanks for the reference. That book sounds very interesting... unfortunately it is also very expensive. --Abram On Thu, Dec 25, 2008 at 1:23 PM, Bruno Marchal marc...@ulb.ac.be wrote: On 25 Dec 2008, at 08:05, Abram Demski wrote: Bruno, I agree with Gunther about the two types of

Re: Machines was:Kim 2.1

2008-12-26 Thread Bruno Marchal
On 26 Dec 2008, at 20:24, Abram Demski wrote: Bruno, In one sense those examples are things for which (finite) reasoning fails, but I would still say that they are governed by (finite) rules and possess a (finite) description-- Yes but we have to bet we share the standard interpretation

Re: Machines was:Kim 2.1

2008-12-26 Thread Bruno Marchal
Abram, Thanks for the reference. That book sounds very interesting... unfortunately it is also very expensive. Then don't buy it. In my opinion, well to get the AUDA, the following one are without doubt more genuine. Actually I complained often that the Boolos 1979 book was out of stock