Re: Making true on the basis of meaning computable from finite strings

From	wij <wyniijj5@gmail.com>
Newsgroups	comp.theory
Subject	Re: Making true on the basis of meaning computable from finite strings
Date	2025-11-14 05:35 +0800
Organization	A noiseless patient Spider
Message-ID	<7ef8dece22149bf576aedb8d9f2ab43ddad22ae8.camel@gmail.com> (permalink)
References	(8 earlier) <10f20bf$1emgs$1@dont-email.me> <10f45t6$21bpf$1@dont-email.me> <10f4ucr$28csl$1@dont-email.me> <20251113094850.31@kylheku.com> <10f5hmb$2eg1r$1@dont-email.me>

Show all headers | View raw

On Thu, 2025-11-13 at 15:13 -0600, olcott wrote:
> On 11/13/2025 11:50 AM, Kaz Kylheku wrote:
> > On 2025-11-13, olcott <polcott333@gmail.com> wrote:
> > > Whenever a cycle is detected in the directed graph
> > > of the evaluation sequence of a formal expression
> > > occurs you are too confused to understand what any
> > > of those words mean.
> > 
> > You could not pass a modern interview live coding question involving
> > directed graphs to save your life.
> > 
> 
> My question was a dare to you and you dodged it with
> baseless ad hominem. It was also such a complex
> combination of things that you can't Google it to cheat.

You have proved that you don't even understand the logic 'if'. 
(wanna try again, genius?)

The consequence is enormous: you cannot understand any CS term/stuff (at least).
You cannot communicate CS stuff in comp.*

> I have two US patents involving deterministic finite
> automata state transition diagrams (a type of directed
> graph).

The patents proved that on one had ever been so stupid. No possibility it could 
duplicate anyone's IP.
The patent official was smart ... take the money first (thanks, on behalf of US
and mankind).

Thread

Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-08 12:46 -0600
  Re: Making true on the basis of meaning computable from finite strings Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-08 21:48 +0000
    Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-08 16:41 -0600
    Re: Making true on the basis of meaning computable from finite strings "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-08 15:23 -0800
    Re: Making true on the basis of meaning computable from finite strings "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-08 15:26 -0800
  Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-09 12:08 +0200
    Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-09 06:56 -0600
      Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-10 11:48 +0200
        Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-10 08:58 -0600
          Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-11 11:07 +0200
            Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-11 07:06 -0600
              Re: Making true on the basis of meaning computable from finite strings "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-11 13:24 -0800
              Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-12 09:20 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-12 06:59 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-13 10:46 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-13 09:44 -0600
                Re: Making true on the basis of meaning computable from finite strings Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 17:50 +0000
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-13 15:13 -0600
                Re: Making true on the basis of meaning computable from finite strings wij <wyniijj5@gmail.com> - 2025-11-14 05:35 +0800
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-14 11:11 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-14 08:52 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-15 12:29 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-15 10:20 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-16 11:14 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-16 18:08 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-17 10:38 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-17 07:24 -0600
                Re: Making true on the basis of meaning computable from finite strings --- correction olcott <polcott333@gmail.com> - 2025-11-17 07:26 -0600
                Re: Making true on the basis of meaning computable from finite strings --- correction dbush <dbush.mobile@gmail.com> - 2025-11-17 08:35 -0500
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-18 12:15 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-18 10:40 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-19 12:05 +0200
                Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-19 07:05 -0600
                Re: Making true on the basis of meaning computable from finite strings Mikko <mikko.levanto@iki.fi> - 2025-11-20 11:02 +0200

csiph-web