News for hackers. Stuff that matters.
Re:Don't forget randomness is still just a hypothesis (2006) by yters on Sunday August 11, 2019 @08:48PM (#20671558)
Also a bitstring might be random/incompressible in reference to a Turing machine, but become compressible in reference to a halting oracle. E.g. "list the Nth Turing incompressible bitstring" is possible with a halting oracle, so for some N and S it is the case that log2(N) < len(S) and thus S is compressible with regard to a halting oracle but not with regard to a Turing machine.

There are no comments on this comment yet.