1. Forum
  2. Newsgroups
  3. comp.theory

  • First documented use of: "finite string transformation rules"

    From olcott@NoOne@NoWhere.com to comp.theory,sci.logic,sci.lang,sci.math on Sun Dec 21 17:12:15 2025
    From Newsgroup: comp.theory

    On 6/10/2017 1:32 PM, Pete Olcott wrote:

    I am using sub atomic semantic compositionality (from my own formal linguistics theory) to specify a system of types such that these types
    are composed from the smallest possible constituent parts.

    All other linguistic theories of formal semantics stop the decomposition
    at the atomic level, essentially one whole thought. I break it down
    further into the smallest possible micro elements of a complete thought.

    Even the operators of my Minimal Type Theory (MTT) require their
    defining axioms to be explicitly specified otherwise these operators
    remain utterly meaningless.

    Basically I formalize the entire set of all knowledge (mathematical and otherwise) simply as finite string transformation rules.

    When I do this I discover key semantic gaps in the expressiveness of
    other formal systems.

    One of these key gaps (Pathological Self Reference) was first mentioned
    in comp.theory On 9/5/2004 11:21 AM.

    The directed acyclic graph of Minimal Type Theory finally explicitly formalizes the notion of PSR. http://liarparadox.org/Provability_with_Minimal_Type_Theory.pdf


    My first documented use of the term
    "finite string transformation rules" https://groups.google.com/g/comp.theory/c/TFXhleKnHmY/m/lqhDVnvUBgAJ


    Deciders: Transform finite string inputs by finite
    string transformation rules into {Accept, Reject} values.
    --
    Copyright 2025 Olcott

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

    This required establishing a new foundation
    for correct reasoning.
    --- Synchronet 3.21a-Linux NewsLink 1.2