Encyclopedia > Talk:Chaitin's constant

  Article Content

Talk:Chaitin's constant

... then there exists a constant N such that no digit of Ù after the N-th can be proven to be one or zero within that system.

Is this true? It seems like this states that there are at most a finite number of Turing machines that can be proven to either halt or not halt (given some system of enumeration, etc.). Chas zzz brown 02:06 Feb 5, 2003 (UTC)

Ooops! In the words of emily latella, "never mind". I misread that the nth digit of Ω was 1 iff Turing machine n halts. Chas zzz brown 09:00 Feb 5, 2003 (UTC)b



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
U.S. presidential election, 1804

... Wikipedia <<Up     Contents U.S. presidential election, 1804 Presidential CandidateElectoral Vote Party Running Mate(Electoral ...

 
 
 
This page was created in 26.5 ms