We know (by Rice's theorem) that is it not possible to decide a non-trivial property of a given TM. We could say therefore that we cannot be sure at 100 percent that a given TM has a certain non-trivial property.Therefore we cannot know if it is 100 percent impossible to show that a given TM has a certain non-trivial property. Right?So my question is this: as (maybe) we could guess a non-trivial property of a Turing machine, is Rice's theorem just a statistical statement on the probability of finding out a given non-trivial property?BONUS question: is that probability related to Chaitin's constant?
Is undecidability of TMs' properties a statistical statement?
turing machines;undecidability;semi decidability;rice theorem