Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.ai.philosophy    |    Perhaps we should ask SkyNet about this    |    59,235 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 58,810 of 59,235    |
|    olcott to olcott    |
|    Re: Proof that the halting problem is in    |
|    25 Dec 25 19:45:03    |
      XPost: comp.theory, sci.logic, sci.math       From: polcott333@gmail.com              On 12/25/2025 5:39 PM, olcott wrote:       >       > https://chatgpt.com/share/694dcae3-a210-8011-b12f-a74007045a4a       >              "Any result that cannot be derived as a pure function        of finite strings is uncomputable."              Deciders are not accountable for anything that       is not a pure function of their actual inputs.              It is categorically impossible for there to       be a better measure of the actual behavior       that the actual input actually specifies       to H(P) that H computes as a pure function       of its actual input than P simulated by H.              --       Copyright 2025 Olcott |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca