Re: [CI] Re: Turing thesis(Incompleteness theorom)

[gfgs pedo]

hi,

thank you Mr. Jim,one more query, regarding Godel's
incompleteness theorom.

with reference to
http://www.miskatonic.org/godel.html

"
Gödel asks for the program and the circuit design of
the UTM. The program may be complicated, but it can
only be finitely long. Call the program P(UTM) for
Program of the Universal Truth Machine. "

we know that there are unprovable and provable
statements and there is no way to distinguish all
solvabe problems from unsolvable ones as you said
below.
> 
> > Also have can we distinguish between provable and
> unprovable statements.
> 
> That is an unsolvable problem if you are looking for
> a general approach to
> -any- statement, that -is- Godel's.
> 

In godel's  theorom,above mentioned,it says circuit
design and programme must be finitely long.

Is that necessary?we can't say for sure,right?Isn't it
an unprovable statement which is made or more likely
an assumption.

if we say other wise,why has the programme to be
finite?
Thank you very much.

Regards  Data.

__
Do You Yahoo!?
HotJobs - Search Thousands of New Jobs
http://www.hotjobs.com

Re: [CI] Re: Turing thesis(Incompleteness theorom)

[R. A. Hettinga]

At 11:58 AM -0700 on 8/11/02, James A. Donald wrote:


> Choate's universe is a very strange place.

One could even say it was, um, loopy...

:-).

Cheers,
RAH

-- 
-
R. A. Hettinga 
The Internet Bearer Underwriting Corporation 
44 Farquhar Street, Boston, MA 02131 USA
"... however it may deserve respect for its usefulness and antiquity,
[predicting the end of the world] has not been found agreeable to
experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'

Re: [CI] Re: Turing thesis(Incompleteness theorom)

[James A. Donald]

--
On 11 Aug 2002 at 10:36, Jim Choate wrote:
> All Godel really says is that math, physics, etc. must be taken
> on -faith- with regard to 'consistency'. In other words,
> 'science' is just another 'religion'.

Choate's universe is a very strange place.




--digsig
 James A. Donald
 6YeGpsZR+nOTh/cGwvITnSR3TdzclVpR0+pr3YYQdkG
 g1mLlIzuFgLbXoOJFMHUW25JFxvX68MxJVBaw2T9
 2CyHwAWleXXEw7dAtv/o5PkeHz4+rp/NEMJFQPNfd

Re: [CI] Re: Turing thesis(Incompleteness theorom)

[Jim Choate]

On Sun, 11 Aug 2002, gfgs pedo wrote:

> with reference to
> http://www.miskatonic.org/godel.html
> 
> "
> Gödel asks for the program and the circuit design of
> the UTM. The program may be complicated, but it can
> only be finitely long. 

I know of no such requirement in Godel's Theorem, since I didn't write the
above site I can't really address what they meant to say. I would suggest
contacting the author for clarification. It's also worth mentioning that
Godel announced his work in 1931, Turing in 1936. I'd be suspect of any
comment about Godel that had anything to do with TM's in a 'proof'.
'Computabilty' and 'Proof/Consistency' are not equivalent.

All Godel really says is that math, physics, etc. must be taken on -faith-
with regard to 'consistency'. In other words, 'science' is just another
'religion'. The reason is that if you can't prove all statements then any
statement you do 'prove' is suspect because there are statements out there
that -might- express a boundary condition the original proof didn't take
into account. Such statements themselves may be unprovable. This means
that even 'proven' statements aren't -really- 'proven'. It's a 'Scope' problem.

That's why I'm a Pantheist. Einstein was wrong, Hawkings was right. God
not only plays with dice, he sometimes throws them where you can't see
them (ever).


 --


  Conform and be dull..J. Frank Dobie

 [EMAIL PROTECTED] www.ssz.com
 [EMAIL PROTECTED]  www.open-forge.org