1. Forum
  2. Newsgroups
  3. comp.theory

  • Categorically exhaustive reasoning

    From olcott@polcott333@gmail.com to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 24 16:58:26 2025
    From Newsgroup: comp.theory

    We examine all of broad categories of possible solutions to an
    analytical problem eliminating whole categories as infeasible. We progressively refine until we are left with a solution or have proved
    that a solution is categorically impossible.
    --
    Copyright 2025 Olcott<br><br>

    My 28 year goal has been to make <br>
    "true on the basis of meaning expressed in language"<br>
    reliably computable.<br><br>

    This required establishing a new foundation<br>

    --- Synchronet 3.21a-Linux NewsLink 1.2
  • From Richard Damon@Richard@Damon-Family.org to comp.theory,sci.logic,sci.math,comp.ai.philosophy on Wed Dec 24 18:20:05 2025
    From Newsgroup: comp.theory

    On 12/24/25 5:58 PM, olcott wrote:
    We examine all of broad categories of possible solutions to an
    analytical problem eliminating whole categories as infeasible. We progressively refine until we are left with a solution or have proved
    that a solution is categorically impossible.


    And may, or might not, reach a conclusion.

    Either your logic allows you to ask quesitons you do not know the answer
    to, and thus allows asking questions that turn out to not have answers,
    or your logic can only talk about solved problems, and thus needs no
    ability to reason.

    It seems you want to choose the later as you reject asking computation question about things that turn out not to be comuptable, and thus you indicate that you universe is just an uninteresting toy that can only
    talk about what you already know.
    --- Synchronet 3.21a-Linux NewsLink 1.2