Re: OPPOSITE OF all coin sequences are computable to infinite length ?

From: |-|erc (h_at_r.c)
Date: 01/09/05 

Date: Sun, 9 Jan 2005 13:06:27 +1000

> >
> > define a TM
> > prove it is impossible
> > define a number using impossible TM
>
> The TM for computing Chaitin's Constant is a mutation of
> the TM for computing the halting problem.
>
> [spitsnip]
>

so you prove the halting value of some programs is unknown
then you assign that to a variable, an unknown so to speak?

X = of Halt(777)
an unknown of the unknown. <gag>

Y = "there is a god"
what is the value of Y?

Herc

Relevant Pages

  • Re: Help needed with a proof...
    ... > I am trying to prove that computing M requires the knowledge of K: ... > Let fbe a function, where V is known and K unknown. ... it is necessary to know K - even in the environment ... My attempt goes as following and I would really appraciate if ...
    (sci.crypt)
  • Help needed with a proof...
    ... I am trying to prove that computing M requires the knowledge of K: ... Let fbe a function, where V is known and K unknown. ... My attempt goes as following and I would really appraciate if ... Bartosz Zoltak ...
    (sci.crypt)
  • Re: Is this problem relevant to the Diffie-Hellman problem?
    ... You have a polynomial with k unknown coefficients and one known ...
    (sci.crypt)
  • Re: Registry Editor
    ... "The Unknown P" wrote in message ... > What do you get if you try the regedt32 engine. ... There are three types of people in computing, ... those that can't and those who don't quote. ...
    (microsoft.public.windowsxp.general)
  • Re: A unique number for every "person" - can it be done?
    ... >> If you are asking whether QC can solve the Halting Problem, it can't, ... not one of insufficient computing power. ... > physics, or even Newtonian physics. ... that such a claim (if indeed it has been made by serious scientists) ...
    (comp.programming)