Liste des Groupes | Revenir à s logic |
On 3/11/24 8:56 AM, olcott wrote:The halting problem does not derive a limit to computationOn 3/11/2024 10:36 AM, immibis wrote:But SHOWING that something is logically impossible reveals the limitations that were already there.On 11/03/24 04:33, olcott wrote:Yet in only the same way that the Liar ParadoxThen we are back to undecidability being incorrectly construed>
as an actual limit to computation.
Proof that a certain thing cannot be computed is always a limit to computation.
>
"This sentence is not true."
does not have a truth value that can be computed.
>For example, you can't compute the colour of the number 4. That is an actual limit to computation.>
>
The inability to to the logically impossible is not any actual limit.
If we say that the Halting Problem cannot be solved for the same sort
of reason that Square Circles do not exist then this is not any actual
limit.
Yes, the Halting Theorem doesn't MAKE the problem impossible, it shows that it always was, and gives us knowledge of that.
But, you don't understand the nature of Truth and Knowledge, so that won't make sense.--
>You can't compute the halting problem. That is an actual limit to computation.>
Les messages affichés proviennent d'usenet.