Additional justification: if your data can be perfectly described by a 1000 bit program, you will find that program after at most 1000 + c bits of evidence.
I think you mean BB(1000) bits of evidence?
I was measuring the Kolmogorov complexity of the evidence, but now that you mention it that does make for a bit of circular reasoning.
Ah, I see. Yeah, 1 bit in input bitstream != 1 bit of bayesian evidence.
Assuming you have access to a source of hypercomputation, in which case the universe can’t be described by a turing machine anyway.
Additional justification: if your data can be perfectly described by a 1000 bit program, you will find that program after at most 1000 + c bits of evidence.
I think you mean BB(1000) bits of evidence?
I was measuring the Kolmogorov complexity of the evidence, but now that you mention it that does make for a bit of circular reasoning.
Ah, I see. Yeah, 1 bit in input bitstream != 1 bit of bayesian evidence.
Assuming you have access to a source of hypercomputation, in which case the universe can’t be described by a turing machine anyway.