Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #138946
| From | olcott <polcott333@gmail.com> |
|---|---|
| Newsgroups | comp.theory, sci.logic, sci.math, comp.lang.prolog, comp.software-eng |
| Subject | Re: Computation and Undecidability |
| Date | 2026-01-10 20:20 -0600 |
| Organization | A noiseless patient Spider |
| Message-ID | <10jv1ck$3k39b$1@dont-email.me> (permalink) |
| References | (7 earlier) <10jt29l$313jd$1@dont-email.me> <10jumqv$3haju$1@dont-email.me> <10jur90$2erua$3@dont-email.me> <10jussi$3j0bu$1@dont-email.me> <10jv0dr$2eruc$4@dont-email.me> |
Cross-posted to 5 groups.
On 1/10/2026 8:03 PM, Richard Damon wrote:
> On 1/10/26 8:03 PM, olcott wrote:
>> On 1/10/2026 6:35 PM, Richard Damon wrote:
>>> On 1/10/26 6:19 PM, olcott wrote:
>>>> On 1/10/2026 2:23 AM, Mikko wrote:
>>>>> On 09/01/2026 17:52, olcott wrote:
>>>>>> On 1/9/2026 3:59 AM, Mikko wrote:
>>>>>>> On 08/01/2026 16:22, olcott wrote:
>>>>>>>> On 1/8/2026 4:22 AM, Mikko wrote:
>>>>>>>>> On 07/01/2026 13:54, olcott wrote:
>>>>>>>>>> On 1/7/2026 5:49 AM, Mikko wrote:
>>>>>>>>>>> On 07/01/2026 06:44, olcott wrote:
>>>>>>>>>>>> All deciders essentially: Transform finite string
>>>>>>>>>>>> inputs by finite string transformation rules into
>>>>>>>>>>>> {Accept, Reject} values.
>>>>>>>>>>>>
>>>>>>>>>>>> The counter-example input to requires more than
>>>>>>>>>>>> can be derived from finite string transformation
>>>>>>>>>>>> rules applied to this specific input thus the
>>>>>>>>>>>> Halting Problem requires too much.
>>>>>>>>>>
>>>>>>>>>>> In a sense the halting problem asks too much: the problem is
>>>>>>>>>>> proven to
>>>>>>>>>>> be unsolvable. In another sense it asks too little: usually
>>>>>>>>>>> we want to
>>>>>>>>>>> know whether a method halts on every input, not just one.
>>>>>>>>>>>
>>>>>>>>>>> Although the halting problem is unsolvable, there are partial
>>>>>>>>>>> solutions
>>>>>>>>>>> to the halting problem. In particular, every counter-example
>>>>>>>>>>> to the
>>>>>>>>>>> full solution is correctly solved by some partial deciders.
>>>>>>>>>>
>>>>>>>>>> *if undecidability is correct then truth itself is broken*
>>>>>>>>>
>>>>>>>>> Depends on whether the word "truth" is interpeted in the standard
>>>>>>>>> sense or in Olcott's sense.
>>>>>>>>
>>>>>>>> Undecidability is misconception. Self-contradictory
>>>>>>>> expressions are correctly rejected as semantically
>>>>>>>> incoherent thus form no undecidability or incompleteness.
>>>>>>>
>>>>>>> The misconception is yours. No expression in the language of the
>>>>>>> first
>>>>>>> order group theory is self-contradictory. But the first order goupr
>>>>>>> theory is incomplete: it is impossible to prove that AB = BA is true
>>>>>>> for every A and every B but it is also impossible to prove that
>>>>>>> AB = BA
>>>>>>> is false for some A and some B.
>>>>>>>
>>>>>>
>>>>>> All deciders essentially: Transform finite string
>>>>>> inputs by finite string transformation rules into
>>>>>> {Accept, Reject} values.
>>>>>>
>>>>>> When a required result cannot be derived by applying
>>>>>> finite string transformation rules to actual finite
>>>>>> string inputs, then the required result exceeds the
>>>>>> scope of computation and must be rejected as an
>>>>>> incorrect requirement.
>>>>>
>>>>> No, that does not follow. If a required result cannot be derived by
>>>>> appying a finite string transformation then the it it is uncomputable.
>>>>> Of course, it one can prove that the required result is not computable
>>>>> then that helps to avoid wasting effort to try the impossible. The
>>>>> situation is worse if it is not known that the required result is not
>>>>> computable.
>>>>>
>>>>> That something is not computable does not mean that there is anyting
>>>>> "incorrect" in the requirement. In order to claim that a requirement
>>>>> is incorrect one must at least prove that the requirement does not
>>>>> serve its intended purpose. Even then it is possible that the
>>>>> requirement serves some other purpose. Even if a requirement serves
>>>>> no purpose that need not mean that it be "incorrect", only that it
>>>>> is useless.
>>>>>
>>>>
>>>> *Computation and Undecidability*
>>>>
>>>> Any result that cannot be derived as a pure function of
>>>> finite strings is outside the scope of computation. What
>>>> has been construed as decision problem undecidability
>>>> has always actually been requirements that are outside
>>>> of the scope of computation.
>>>>
>>>> https://www.researchgate.net/
>>>> publication/399111881_Computation_and_Undecidability
>>>>
>>
>> *Computation and Undecidability*
>> https://philpapers.org/go.pl?aid=OLCCAU
>
> Which just shows you don't know what you are talking about.
>
> You said:
> Any result that cannot be derived as a pure function of finite strings
> is outside the scope of computation. What has been construed as decision
> problem undecidability has always actually been requirements that are
> outside of the scope of computation.
>
> Which is just a LIE, based on not knowing what you are talking about.
>
> The "Scope of Computation", as in what scope of problems that Compuation
> Theory looks at, are the mappings of one domain (often limited to a
> countably infinite domain so it is representable as a finte string) to
> another domain.
>
You merely are not bothering to pay close enough
attention to the exact meaning of my words.
> The primary question of that domain, is which mapping can be computed by
> a finite machine using a specific fully defined algorithm.
>
Yes you are correct about this, yet that is a mere
paraphrase of my own words.
> What you can your "Scope of Computation" is the range of what is
> computable.
Yes that is still correct.
> In other words, the "Scope" of what we want to be able to
> do,
Not at all you are totally incorrect and the regulars
that know comp.theory will confirm this.
> and thus the set of problems that ARE computable.
>
> You don't seem to understand the differnce between the problem of
> determining Computability and what is actually computable, just like you
> don't understand the difference between Truth and Knowledge.
>
I proved that I do understand by creating my
own formal definition that is consistent with
standard definitions.
All deciders essentially: Transform finite string
inputs by finite string transformation rules into
{Accept, Reject} values.
>>
>>>
>>> So why isn't DD() -> Halts (since your HHH(DD) returns 0) not a pure
>>> function of the input.
>>>
>>> Now, if your DD doesn't include the code for HHH, then you show your
>>> problem, your input isn't that of a program, and thus out of sco[e.
>>>
>>> The Halting Problem only talks about the behavior of PROGRAMS, which
>>> requires that the input specify ALL of the algorith/code used by it.
>>> so your "C function" DD isn't a valid input without also specifying
>>> the SPECIFIC HHH that it calls.
>>
>> *ChatGPT explains how and why I am correct*
>>
>> *Reinterpretation of undecidability*
>> The example of P and H demonstrates that what is
>> often called “undecidable” is better understood as
>> ill-posed with respect to computable semantics.
>> When the specification is constrained to properties
>> detectable via finite simulation and finite pattern
>> recognition, computation proceeds normally and
>> correctly. Undecidability only appears when the
>> specification overreaches that boundary.
>>
>
> But "Finite Simulation and finite pattern recognition" is NOT "Finiite
> String Transformation".
>
> So, you are just showing you don't understand what you are talking about.
You are just showing you don't understand what you are talking about:
That you don't even know what elements are in the finite string
transformations prove this. *finite simulation* is the ultimate
measure of the behavior that an input finite string specifies.
--
Copyright 2026 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>
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-06 22:44 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-07 13:49 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-07 05:54 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-08 12:22 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-08 08:22 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-09 11:59 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-09 09:52 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-10 10:23 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-10 09:47 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 18:19 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-10 18:13 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 19:35 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-10 18:52 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:03 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-10 20:22 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:34 -0500
Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 21:24 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 22:32 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-11 12:13 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-11 08:18 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-12 12:44 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-12 08:29 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-12 22:19 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 19:25 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-14 22:51 -0500
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-15 15:57 +0000
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-15 10:54 -0600
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-15 11:34 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-15 22:27 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-15 22:03 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-16 11:46 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-30 20:10 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-13 11:11 +0200
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-13 14:23 +0000
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-13 08:34 -0600
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-13 18:23 +0000
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-13 12:50 -0600
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-14 14:52 +0000
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 10:24 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 10:53 +0200
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-14 14:55 +0000
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-15 11:26 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 10:39 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 10:37 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-13 08:27 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 09:40 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 11:28 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-15 11:48 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-15 17:38 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-16 11:17 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-16 08:12 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-16 11:48 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-16 09:12 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-16 11:53 -0500
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-16 12:08 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-17 12:25 +0200
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-11 14:24 +0000
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-11 08:38 -0600
Re: The Halting Problem asks for too much Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-11 12:52 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-12 12:47 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-12 08:32 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-12 22:20 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-13 11:13 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-13 08:31 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 11:01 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 13:32 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-15 11:34 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-15 14:30 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-16 11:32 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-16 09:38 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-17 11:53 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-17 08:47 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-18 13:27 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-18 07:28 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-18 12:55 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-19 10:19 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-20 12:35 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-21 11:03 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-21 09:22 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-22 10:21 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-22 10:40 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-23 11:13 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-23 04:22 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-24 10:20 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 08:01 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-25 13:19 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 07:24 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:27 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 12:33 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:40 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 13:10 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 14:57 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 14:09 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 15:47 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-22 10:47 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-24 10:23 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 08:18 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-25 13:24 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 07:30 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:31 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 13:05 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 14:59 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 14:21 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 15:54 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-26 14:55 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 09:22 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 11:45 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 10:58 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 12:13 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 11:28 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-27 10:17 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-27 09:32 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-28 11:54 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-28 07:49 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-29 11:12 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-29 07:57 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-30 11:34 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-30 08:35 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-31 10:41 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-31 09:23 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-02-01 12:28 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-31 10:56 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-31 09:26 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-02-01 12:17 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-27 10:15 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-27 09:29 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-28 11:45 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-27 10:05 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-27 08:48 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-28 11:40 +0200
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 09:51 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 09:44 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 12:10 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 11:54 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 14:23 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 13:25 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 14:52 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 14:38 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 17:25 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 16:31 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-24 19:52 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-24 19:44 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 13:36 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 13:09 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 14:54 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 14:07 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-25 15:44 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-25 20:31 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 11:49 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 11:23 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 13:24 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 12:43 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 16:58 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 16:08 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 17:36 -0500
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-26 16:44 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-26 21:51 -0500
"true on the basis of meaning expressed in language" olcott <NoOne@NoWhere.com> - 2026-01-26 21:28 -0600
Re: The Halting Problem asks for too much dart200 <user7160@newsgrouper.org.invalid> - 2026-01-24 18:28 -0800
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-11 12:22 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-11 08:23 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-12 12:51 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-12 08:43 -0600
Re: The Halting Problem asks for too much Richard Damon <Richard@Damon-Family.org> - 2026-01-12 22:22 -0500
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-13 10:46 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-13 08:17 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 09:58 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 13:19 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-15 11:38 +0200
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-14 11:04 +0200
Re: The Halting Problem asks for too much olcott <polcott333@gmail.com> - 2026-01-14 13:35 -0600
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-15 11:21 +0200
Re: The Halting Problem asks for too much Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-15 14:52 +0000
Re: The Halting Problem asks for too much Mikko <mikko.levanto@iki.fi> - 2026-01-16 11:21 +0200
Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 17:19 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 19:35 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 19:03 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:03 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 20:20 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:33 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 21:18 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 22:30 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 19:05 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:03 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 20:09 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 21:33 -0500
Re: Computation and Undecidability polcott <polcott333@gmail.com> - 2026-01-10 20:52 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 22:28 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 21:16 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-10 22:28 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-10 21:34 -0600
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-11 06:31 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-11 08:03 -0600
Re: Computation and Undecidability Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2026-01-11 14:39 +0000
Re: Computation and Undecidability Richard Damon <news.x.richarddamon@xoxy.net> - 2026-01-11 12:52 -0500
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-11 12:12 -0600
Re: Computation and Undecidability olcott <polcott333@gmail.com> - 2026-01-11 15:50 -0600
Haskell Curry Foundations of Mathematical Logic sense of true in the system olcott <polcott333@gmail.com> - 2026-01-09 09:47 -0600
csiph-web