Sujet : Re: Flibble's Law
De : richard (at) *nospam* damon-family.org (Richard Damon)
Groupes : comp.theoryDate : 18. Apr 2025, 20:08:55
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <19955e68400bc2ad935f413f012fe04011f7cf75@i2pn2.org>
References : 1
User-Agent : Mozilla Thunderbird
On 4/18/25 3:00 PM, Mr Flibble wrote:
Flibble's Law:
If a problem permits infinite behavior in its formulation, it permits
infinite analysis of that behavior in its decidability scope.
Why?
Especially when the question is "Is the behavior of the process infinite?"
The issue is that fundamentally, knowledge must be based on finite processes, as we can't do infinite analysis and do anything with the answer.
Knowing that a process will be infinite, allows us to not waste all of our time on something that won't get us an answer.
The basic result of all this sort of proof, is that there are cases where we can't ever know for certain if we are on a wild-goose-chase that will never give a result, or we are on a path that WILL give a result eventually if we persist long enough.
Knowing that there ARE Wild-Goose-Chases as fundamental properties of systems lets us plan better for what to do.
We KNOW we can't be perfect in all we do, so we accept realistic results, and try to keep improving.