Re: does sqrt(2) exist in CM?

From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 02/18/05 

Date: 18 Feb 2005 17:06:52 +0100

examachine@gmail.com writes:

> But you see, there is absolutely no pattern in the halting problem, and
> the oracle for the halting problem would need to have actually infinite
> amount of information. A few of the basic things that Chaitin's theory
> illuminates.

  So what deeper reason for incompleteness does Chaitin reveal?

Relevant Pages

  • Re: Halting Problem
    ...  Not an infinite amount of time. ... the theoretical computer running the halting problem ... His machines for the HALTS() ... in an amount of time equal-to or greater-than the amount of time it would ...
    (comp.programming)
  • Re: Halting Problem
    ... Not an infinite amount of time. ... )> I would go a step back and claim that, to make the halting problem ... )> a program halts or not, then *that program* should get that also. ...
    (comp.programming)
  • Re: does sqrt(2) exist in CM?
    ... > the oracle for the halting problem would need to have actually infinite ... > amount of information. ...
    (sci.logic)
  • Re: does sqrt(2) exist in CM?
    ... > the oracle for the halting problem would need to have actually infinite ... > amount of information. ...
    (comp.theory)
  • About halting problem
    ... First - a mistake in Turings unsolvability proof of Halting Problem ... DoesHalt() function inside runtime of program, ... there must be infinite number of DoesHalt ... it must run into infinity - does not halt. ...
    (comp.constraints)