Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #135431 > unrolled thread
| Started by | olcott <polcott333@gmail.com> |
|---|---|
| First post | 2025-11-12 08:45 -0600 |
| Last post | 2025-12-07 13:17 +0200 |
| Articles | 20 on this page of 449 — 21 participants |
Back to article view | Back to comp.theory
Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 08:45 -0600
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 11:57 -0600
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-12 18:12 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 12:31 -0600
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-12 18:46 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 13:11 -0600
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 13:33 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-12 20:17 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 14:45 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 02:25 +0000
D simulated by H cannot possibly reach its own simulated final halt state olcott <polcott333@gmail.com> - 2025-11-12 20:34 -0600
Re: D simulated by H cannot possibly reach its own simulated final halt state Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 02:42 +0000
Re: D simulated by H cannot possibly reach its own simulated final halt state Keith Thompson <Keith.S.Thompson+u@gmail.com> - 2025-11-12 19:49 -0800
Re: D simulated by H cannot possibly reach its own simulated final halt state olcott <polcott333@gmail.com> - 2025-11-12 22:36 -0600
Re: D simulated by H cannot possibly reach its own simulated final halt state David Brown <david.brown@hesbynett.no> - 2025-11-13 08:54 +0100
Re: D simulated by H cannot possibly reach its own simulated final halt state "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-13 00:21 -0800
How to handle pathological cases (was Re: ...) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-11-13 11:18 +0100
Re: How to handle pathological cases (was Re: ...) Richard Harnden <richard.nospam@gmail.invalid> - 2025-11-13 12:14 +0000
Re: How to handle pathological cases (was Re: ...) "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-13 07:06 -0800
Re: How to handle pathological cases (was Re: ...) olcott <polcott333@gmail.com> - 2025-11-13 09:28 -0600
Re: How to handle pathological cases (was Re: ...) olcott <polcott333@gmail.com> - 2025-11-13 09:15 -0600
Re: D simulated by H cannot possibly reach its own simulated final halt state olcott <polcott333@gmail.com> - 2025-11-13 09:22 -0600
Any article that contains the string "olcott" is junk (Was: D simulated by H cannot possibly reach its own simulated final halt state) gazelle@shell.xmission.com (Kenny McCormack) - 2025-11-13 12:36 +0000
Re: Any article that contains the string "olcott" is junk (Was: D simulated by H cannot possibly reach its own simulated final halt state) Janis Papanagnou <janis_papanagnou+ng@hotmail.com> - 2025-11-13 13:49 +0100
Re: Any article that contains the string "olcott" is junk (Was: D simulated by H cannot possibly reach its own simulated final halt state) gazelle@shell.xmission.com (Kenny McCormack) - 2025-11-13 12:55 +0000
Re: Any article that contains the string "olcott" is junk (Was: D simulated by H cannot possibly reach its own simulated final halt state) olcott <polcott333@gmail.com> - 2025-11-13 09:26 -0600
Re: Any article that contains the string "olcott" is junk (Was: D simulated by H cannot possibly reach its own simulated final halt state) olcott <polcott333@gmail.com> - 2025-11-13 09:24 -0600
Re: D simulated by H cannot possibly reach its own simulated final halt state olcott <polcott333@gmail.com> - 2025-11-12 22:53 -0600
Re: D simulated by H cannot possibly reach its own simulated final halt state Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 04:42 +0000
Re: D simulated by H cannot possibly reach its own simulated final halt state Richard Damon <Richard@Damon-Family.org> - 2025-12-14 20:59 -0500
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-12 20:49 +0000
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-13 11:18 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 10:06 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 19:04 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 15:18 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-14 10:53 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 08:33 -0600
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-14 14:56 +0000
Libelous statements that meet the burden of proof of reckless disregard of the truth olcott <polcott333@gmail.com> - 2025-11-14 09:33 -0600
Re: Statements that are true, with full regard for the truth Alan Mackenzie <acm@muc.de> - 2025-11-14 15:52 +0000
Libelous statements that meet the burden of proof of reckless disregard of the truth olcott <polcott333@gmail.com> - 2025-11-14 10:03 -0600
Re: Statements that are true, with full regard for the truth dart200 <user7160@newsgrouper.org.invalid> - 2025-11-14 09:05 -0800
Re: Statements that are true, with full regard for the truth Alan Mackenzie <acm@muc.de> - 2025-11-14 17:52 +0000
Re: Statements that are true, with full regard for the truth olcott <polcott333@gmail.com> - 2025-11-14 12:16 -0600
Re: Statements that are true, with full regard for the truth dart200 <user7160@newsgrouper.org.invalid> - 2025-11-14 12:59 -0800
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-14 11:45 -0800
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-14 20:09 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 14:30 -0600
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-14 20:43 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 14:58 -0600
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-15 11:59 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 13:31 +0000
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-16 08:49 +0000
"true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-16 10:01 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-16 22:20 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-16 20:08 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 13:21 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 07:46 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 17:00 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 11:04 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 17:29 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 11:36 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 21:11 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 17:23 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 23:38 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 17:45 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-18 00:01 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 18:34 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-18 13:45 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-18 09:15 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 02:28 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 21:51 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 13:16 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 02:23 +0000
eric is not a crank dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 11:41 -0800
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-17 13:44 -0600
Re: eric is not a crank Alan Mackenzie <acm@muc.de> - 2025-11-17 20:34 +0000
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-17 14:45 -0600
Re: eric is not a crank dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 13:24 -0800
Re: eric is not a crank dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 13:30 -0800
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-17 16:20 -0600
Re: eric is not a crank dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 15:03 -0800
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-17 17:35 -0600
polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 16:06 -0800
Re: polcott agrees with the halting problem olcott <polcott333@gmail.com> - 2025-11-17 18:31 -0600
Re: polcott agrees with the halting problem dbush <dbush.mobile@gmail.com> - 2025-11-17 19:43 -0500
Re: polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 18:46 -0800
Re: polcott agrees with the halting problem Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 03:07 +0000
Re: polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 19:10 -0800
Re: polcott agrees with the halting problem "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-17 19:36 -0800
Re: polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 21:18 -0800
Re: polcott agrees with the halting problem "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-18 15:10 -0800
Re: polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-18 17:40 -0800
Re: polcott agrees with the halting problem olcott <polcott333@gmail.com> - 2025-11-18 19:46 -0600
Re: polcott agrees with the halting problem Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 17:17 +0000
help i'm stuck in a liar's paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 10:43 -0800
Re: help i'm stuck in a liar's paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 18:48 +0000
Re: help i'm stuck in a liar's paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 11:19 -0800
Re: help i'm stuck in a liar's paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 19:47 +0000
Re: help i'm stuck in a liar's paradox --- TXR and AWK olcott <polcott333@gmail.com> - 2025-11-19 14:49 -0600
Re: help i'm stuck in a liar's paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 21:01 -0800
Re: help i'm stuck in a liar's paradox olcott <polcott333@gmail.com> - 2025-11-19 14:18 -0600
Re: polcott agrees with the halting problem "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-19 13:03 -0800
Re: polcott agrees with the halting problem Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 03:45 +0000
polcott agrees the halting problem is wrong olcott <polcott333@gmail.com> - 2025-11-17 22:07 -0600
Re: polcott agrees with the halting problem Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 17:41 +0000
polcott agrees the halting problem is incorrect olcott <polcott333@gmail.com> - 2025-11-19 12:37 -0600
Re: polcott agrees the halting problem is incorrect Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 20:55 +0000
Re: polcott agrees the halting problem is incorrect olcott <polcott333@gmail.com> - 2025-11-19 15:05 -0600
Re: polcott agrees the halting problem is incorrect Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 21:41 +0000
Re: polcott agrees the halting problem is incorrect olcott <polcott333@gmail.com> - 2025-11-19 21:12 -0600
Re: polcott agrees the halting problem is incorrect Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 04:42 +0000
Re: polcott agrees the halting problem is incorrect olcott <polcott333@gmail.com> - 2025-11-19 22:57 -0600
Re: polcott agrees the halting problem is incorrect "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 13:22 -0800
Re: polcott agrees the halting problem is incorrect Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 22:10 +0000
Re: polcott agrees the halting problem is incorrect "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 14:56 -0800
polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-20 17:24 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 15:27 -0800
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 02:42 +0000
polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-20 20:50 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 19:10 -0800
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 04:12 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 04:13 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 20:23 -0800
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-20 22:41 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 05:04 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-21 09:19 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 17:29 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-21 12:15 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 18:22 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 19:18 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-21 13:33 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 22:05 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <NoOne@NoWhere.com> - 2025-11-21 23:14 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Richard Heathfield <rjh@cpax.org.uk> - 2025-11-22 05:39 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-22 07:05 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 07:00 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-22 07:26 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-22 19:29 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-22 13:44 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-22 20:07 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-22 14:13 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-23 04:09 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-23 04:07 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-23 04:20 +0000
Glossary of names in my termination analyzer system olcott <polcott333@gmail.com> - 2025-11-22 22:50 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-21 22:12 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-21 21:56 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 02:54 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH olcott <polcott333@gmail.com> - 2025-11-21 23:06 -0600
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 18:07 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 18:07 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-21 13:42 -0800
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 18:10 +0000
Re: polcott agrees the Kaz is a damned liar --- DD simulated by HHH Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-22 19:36 +0000
polcott agrees the halting problem is incorrect --- is libel against him olcott <polcott333@gmail.com> - 2025-11-20 20:00 -0600
polcott agrees that the halting problem is incorrect in this way olcott <polcott333@gmail.com> - 2025-11-17 21:47 -0600
Re: polcott agrees with the halting problem Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-18 23:47 +0000
Re: polcott agrees with the halting problem Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 00:13 +0000
Re: polcott agrees with the halting problem Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-19 00:57 +0000
polcott has shwn that the halting problem is incorrect olcott <polcott333@gmail.com> - 2025-11-18 18:17 -0600
Liars try to get away with DD simulated by HHH halts olcott <polcott333@gmail.com> - 2025-11-18 18:24 -0600
Re: Liars try to get away with DD simulated by HHH halts Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 01:06 +0000
Re: Liars try to get away with DD simulated by HHH halts Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 01:07 +0000
Re: Liars try to get away with DD simulated by HHH halts olcott <polcott333@gmail.com> - 2025-11-18 19:41 -0600
Re: Liars try to get away with DD simulated by HHH halts Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 18:20 +0000
Re: Liars try to get away with DD simulated by HHH halts olcott <polcott333@gmail.com> - 2025-11-19 12:49 -0600
Re: Liars try to get away with DD simulated by HHH halts Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 19:18 +0000
Re: Liars try to get away with DD simulated by HHH halts "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-19 12:40 -0800
Re: Liars try to get away with DD simulated by HHH halts "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-19 12:44 -0800
Re: Liars try to get away with DD simulated by HHH halts Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-20 01:56 +0000
Re: Liars try to get away with DD simulated by HHH halts olcott <polcott333@gmail.com> - 2025-11-19 20:19 -0600
Re: Liars try to get away with DD simulated by HHH halts "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 13:25 -0800
Re: Liars try to get away with DD simulated by HHH halts Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-20 22:05 +0000
Re: Liars try to get away with DD simulated by HHH halts "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 15:43 -0800
Re: Liars try to get away with DD simulated by HHH halts Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 21:03 +0000
Re: Liars try to get away with DD simulated by HHH halts olcott <polcott333@gmail.com> - 2025-11-19 21:13 -0600
Re: polcott agrees with the halting problem dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 10:26 -0800
Re: polcott agrees with the halting problem Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-19 19:42 +0000
polcott agrees the halting problem is incorrect --- quit lying about what I say olcott <polcott333@gmail.com> - 2025-11-19 14:45 -0600
Re: polcott agrees with the halting problem "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-19 12:51 -0800
Re: polcott agrees with the halting problem Jeff Barnett <jbb@notatt.com> - 2025-11-19 16:04 -0700
Re: polcott agrees with the halting problem olcott <polcott333@gmail.com> - 2025-11-19 17:43 -0600
Re: polcott agrees with the halting problem Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-20 00:04 +0000
homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 18:08 -0800
Re: homework assignment for the group: multi-decider paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 02:29 +0000
Re: homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 18:49 -0800
Re: homework assignment for the group: multi-decider paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 02:58 +0000
Re: homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 19:53 -0800
Re: homework assignment for the group: multi-decider paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 19:55 +0000
Re: homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 12:03 -0800
Re: homework assignment for the group: multi-decider paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 20:14 +0000
Re: homework assignment for the group: multi-decider paradox Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 20:24 +0000
Re: homework assignment for the group: multi-decider paradox Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 07:22 +0000
Re: homework assignment for the group: multi-decider paradox Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2025-11-20 20:53 +0000
Re: homework assignment for the group: multi-decider paradox Richard Heathfield <rjh@cpax.org.uk> - 2025-11-20 21:09 +0000
Re: homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 13:35 -0800
Re: homework assignment for the group: multi-decider paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 22:06 +0000
Re: homework assignment for the group: multi-decider paradox dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 13:50 -0800
Re: polcott agrees with the halting problem "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-20 18:10 -0800
Re: polcott agrees with the halting problem olcott <polcott333@gmail.com> - 2025-11-17 21:37 -0600
Re: eric is not a crank Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 23:28 +0000
Re: eric is not a crank "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-17 13:33 -0800
Re: eric is not a crank dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 13:44 -0800
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-17 16:49 -0600
Re: eric is not a crank Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 22:39 +0000
Re: eric is not a crank Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 23:21 +0000
Re: eric is not a crank Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 23:36 +0000
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-18 17:43 -0600
Re: eric is not a crank "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-18 16:06 -0800
Re: eric is not a crank Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 18:24 +0000
Re: eric is not a crank olcott <polcott333@gmail.com> - 2025-11-18 17:40 -0600
the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 13:22 -0800
Re: the halting problem is founded in computer science olcott <polcott333@gmail.com> - 2025-11-17 16:48 -0600
Re: the halting problem is founded in computer science Alan Mackenzie <acm@muc.de> - 2025-11-18 13:36 +0000
the halting problem is founded in computer science not math olcott <polcott333@gmail.com> - 2025-11-18 08:50 -0600
Re: the halting problem is founded in computer science not math Alan Mackenzie <acm@muc.de> - 2025-11-18 20:02 +0000
Re: the halting problem is founded in computer science not math olcott <polcott333@gmail.com> - 2025-11-18 14:12 -0600
Re: the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-18 13:04 -0800
Re: the halting problem is founded in computer science Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 18:36 +0000
Re: the halting problem is founded in computer science Ben Bacarisse <ben@bsb.me.uk> - 2025-11-19 23:36 +0000
Re: the halting problem is founded in computer science olcott <NoOne@NoWhere.com> - 2025-11-19 17:53 -0600
Re: the halting problem is founded in computer science Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 00:01 +0000
Re: the halting problem is founded in computer science Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 00:01 +0000
Re: the halting problem is founded in computer science olcott <polcott333@gmail.com> - 2025-11-19 21:11 -0600
Re: the halting problem is founded in computer science Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 20:05 +0000
Re: the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 18:15 -0800
Re: the halting problem is founded in computer science Ben Bacarisse <ben@bsb.me.uk> - 2025-11-20 23:15 +0000
Re: the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 23:38 -0800
Making True(Language L, Expression E) always computable olcott <polcott333@gmail.com> - 2025-11-21 09:09 -0600
Re: the halting problem is founded in computer science Ben Bacarisse <ben@bsb.me.uk> - 2025-11-22 03:02 +0000
halting problem counter example H/D pair is the Liar Paradox olcott <NoOne@NoWhere.com> - 2025-11-21 21:34 -0600
Re: halting problem counter example H/D pair is the Liar Paradox Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-22 04:26 +0000
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 06:08 +0000
Re: halting problem counter example H/D pair is the Liar Paradox olcott <polcott333@gmail.com> - 2025-11-22 07:16 -0600
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 16:45 +0000
Re: halting problem counter example H/D pair is the Liar Paradox olcott <polcott333@gmail.com> - 2025-11-22 11:14 -0600
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 17:44 +0000
Re: halting problem counter example H/D pair is the Liar Paradox olcott <polcott333@gmail.com> - 2025-11-22 11:48 -0600
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-22 18:05 +0000
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-23 04:13 +0000
Re: halting problem counter example H/D pair is the Liar Paradox Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-23 04:11 +0000
Re: the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-21 20:14 -0800
Re: the halting problem is founded in computer science dart200 <user7160@newsgrouper.org.invalid> - 2025-11-19 18:25 -0800
Re: the halting problem is founded in computer science Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 07:46 +0000
"great now there's n+1 formal systems" reports dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 02:24 -0800
Re: "great now there's n+1 formal systems" reports Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 14:41 +0000
Re: "great now there's n+1 formal systems" reports dart200 <user7160@newsgrouper.org.invalid> - 2025-11-20 12:03 -0800
Re: "great now there's n+1 formal systems" reports Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 20:39 +0000
Re: "great now there's n+1 formal systems" reports dart200 <user7160@newsgrouper.org.invalid> - 2025-11-21 10:59 -0800
Re: the halting problem is founded in computer science Ben Bacarisse <ben@bsb.me.uk> - 2025-11-20 23:17 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 21:41 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 13:50 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 22:15 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-17 22:45 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 22:54 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 23:05 +0000
The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-17 16:59 -0600
Re: The halting problem is merely the Liar Paradox in disguise Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 23:22 +0000
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 06:40 +0000
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 01:03 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-18 19:36 -0600
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 18:51 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-19 14:22 -0600
Re: The halting problem is merely the Liar Paradox in disguise Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 20:55 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-19 21:24 -0600
Re: The halting problem is merely the Liar Paradox in disguise Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-20 04:46 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-19 22:58 -0600
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 08:06 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-22 08:12 -0600
Re: The halting problem is merely the Liar Paradox in disguise dbush <dbush.mobile@gmail.com> - 2025-11-22 10:15 -0500
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-22 18:42 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-22 13:06 -0600
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-20 20:49 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-21 13:50 -0600
Re: The halting problem is merely the Liar Paradox in disguise Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-21 22:05 +0000
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-19 02:47 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-18 21:04 -0600
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-21 01:14 +0000
Re: The halting problem is merely the Liar Paradox in disguise Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-21 01:28 +0000
Re: The halting problem is merely the Liar Paradox in disguise olcott <polcott333@gmail.com> - 2025-11-20 22:00 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 22:59 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 15:09 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 23:31 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 17:39 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-17 23:48 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 16:00 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 18:07 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-18 00:19 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 18:58 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 21:40 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Alan Mackenzie <acm@muc.de> - 2025-11-18 11:02 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 17:36 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 06:48 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 22:41 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 15:10 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 23:33 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 16:04 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 18:26 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 02:16 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) dart200 <user7160@newsgrouper.org.invalid> - 2025-11-17 19:02 -0800
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 21:43 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 12:57 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-18 12:52 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 16:54 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 20:51 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 17:20 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 23:44 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 22:44 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 06:40 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-18 08:04 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-18 21:58 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-18 16:56 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-18 17:04 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 07:52 -0600
Re: "true on the basis of meaning" AKA Analytic(Olcott) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-17 16:01 +0000
Re: "true on the basis of meaning" AKA Analytic(Olcott) olcott <polcott333@gmail.com> - 2025-11-17 10:29 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-16 18:55 +0000
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-16 21:43 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-16 18:48 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-17 04:09 +0000
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-16 13:24 -0800
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 09:38 -0600
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-15 12:59 -0800
Re: Rejecting expressions of formal language having pathological self-reference wij <wyniijj5@gmail.com> - 2025-11-16 05:28 +0800
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-27 00:44 -0800
Re: Rejecting expressions of formal language having pathological self-reference wij <wyniijj5@gmail.com> - 2025-11-27 19:37 +0800
Re: Rejecting expressions of formal language having pathological self-reference Alan Mackenzie <acm@muc.de> - 2025-11-16 09:32 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 13:11 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 13:03 +0000
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 14:39 +0000
Re: Rejecting expressions of formal language having pathological self-reference dart200 <user7160@newsgrouper.org.invalid> - 2025-11-15 06:43 -0800
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 15:29 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 09:41 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 16:32 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 11:03 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 17:24 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 11:38 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 18:06 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 12:50 -0600
Re: Rejecting expressions of formal language having pathological self-reference wij <wyniijj5@gmail.com> - 2025-11-16 03:30 +0800
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 13:55 -0600
Re: Rejecting expressions of formal language having pathological self-reference wij <wyniijj5@gmail.com> - 2025-11-16 04:04 +0800
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 14:14 -0600
Re: Rejecting expressions of formal language having pathological self-reference wij <wyniijj5@gmail.com> - 2025-11-16 04:25 +0800
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 14:48 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 21:55 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 16:18 -0600
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-15 13:05 -0800
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-15 11:56 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 09:51 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 16:35 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 11:05 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 17:27 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 11:40 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 18:08 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 12:53 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 20:31 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 14:55 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 22:02 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-15 22:54 +0000
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-15 23:30 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 17:32 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-16 00:10 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-16 18:44 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-16 18:41 -0600
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-15 17:22 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-16 01:07 +0000
Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) olcott <polcott333@gmail.com> - 2025-11-15 19:29 -0600
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-16 19:11 +0000
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) olcott <polcott333@gmail.com> - 2025-11-16 18:52 -0600
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-17 01:45 +0000
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) olcott <polcott333@gmail.com> - 2025-11-16 20:13 -0600
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-17 03:41 +0000
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) olcott <polcott333@gmail.com> - 2025-11-16 21:50 -0600
Re: Rejecting expressions of formal language having infinite loops --- G ↔ ¬Prov(⌜G⌝) Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-17 04:04 +0000
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-16 10:55 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-16 14:37 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-17 11:11 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-17 07:44 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-18 11:26 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-18 09:51 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-19 11:53 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-19 07:02 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-19 18:13 +0000
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-20 10:08 +0200
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-16 13:27 -0800
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-12 18:39 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 12:52 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 02:36 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 20:57 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 03:22 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 22:43 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 08:44 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 09:38 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 18:57 +0000
Re: Rejecting expressions of formal language having pathological self-reference joes <noreply@example.org> - 2025-11-16 15:45 +0000
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 00:09 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 18:45 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 01:02 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 20:29 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 13:09 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 07:42 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 01:14 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 20:33 -0600
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 10:45 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 02:22 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 20:32 -0600
Re: Rejecting expressions of formal language having pathological self-reference Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-13 02:38 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 22:48 -0600
Re: Rejecting expressions of formal language having pathological self-reference Richard Heathfield <rjh@cpax.org.uk> - 2025-11-13 04:50 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-12 23:00 -0600
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-13 00:16 -0800
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-13 11:05 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-13 10:00 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-14 11:01 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 08:42 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-26 12:30 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-26 09:27 -0600
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-26 19:46 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-26 14:07 -0600
Re: Rejecting expressions of formal language having pathological self-reference Richard Damon <Richard@Damon-Family.org> - 2025-11-26 21:00 -0500
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-12-01 14:45 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-12-01 09:18 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-27 10:22 +0200
Re: Rejecting expressions of formal language having pathological self-reference "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-27 00:39 -0800
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-27 10:20 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-27 09:49 -0600
Re: Rejecting expressions of formal language having pathological self-reference Richard Damon <Richard@Damon-Family.org> - 2025-11-27 12:27 -0500
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-28 10:45 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-28 09:22 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-29 12:28 +0200
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 00:56 +0000
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-14 11:09 +0200
Re: Rejecting expressions of formal language having pathological self-reference Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> - 2025-11-14 13:20 +0000
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-14 08:49 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-26 12:17 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-26 09:20 -0600
Re: Rejecting expressions of formal language having pathological self-reference Richard Damon <Richard@Damon-Family.org> - 2025-11-26 10:25 -0500
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-27 10:17 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-27 09:48 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-28 10:40 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-28 09:21 -0600
Re: Rejecting expressions of formal language having pathological self-reference Richard Damon <Richard@Damon-Family.org> - 2025-11-28 11:03 -0500
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-11-29 12:31 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-11-29 12:01 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-12-01 12:18 +0200
Re: Rejecting expressions of formal language having pathological self-reference olcott <polcott333@gmail.com> - 2025-12-01 06:45 -0600
Re: Rejecting expressions of formal language having pathological self-reference Mikko <mikko.levanto@iki.fi> - 2025-12-07 13:17 +0200
Page 14 of 23 — ← Prev page 1 … 12 13 [14] 15 16 … 23 Next page →
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-19 01:03 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fj51u$1u7ku$1@dont-email.me> |
| In reply to | #135913 |
On 17/11/2025 22:59, olcott wrote: > On 11/17/2025 4:45 PM, Tristan Wibberley wrote: >> On 17/11/2025 22:15, Alan Mackenzie wrote: >> >>> There is no proper academic conversation to be had over 2 + 2 = 4. >>> It is >>> firm, unassailable knowledge, unchallengeable. The Halting Theorem >>> is of >>> the same status, proven using the same methodology from the same >>> fundamentals. >> >> >> It's a completely different league from 2 + 2 = 4. >> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder >> than that. >> It's more like the problem of whether a fixed point exists or not, but >> it's for the fixed point of a limit of a particular, conceptually weird, >> sequence of functions. >> >> It really is quite peculiar. >> > > Ultimately it is essentially the Liar Paradox in disguise. > > The Liar Paradox formalized in the Prolog Programming language > > This sentence is not true. > It is not true about what? > It is not true about being not true. > It is not true about being not true about what? > It is not true about being not true about being not true. > Oh I see you are stuck in a loop! > > This is formalized in the Prolog programming language below. > > ?- LP = not(true(LP)). > LP = not(true(LP)). > ?- unify_with_occurs_check(LP, not(true(LP))). > false. true/0 use \+/1 rather than not/1 > Failing an occurs check seems to mean that the > resolution of an expression remains stuck in an ^^^^^^^^^^ > infinite loop. You mean "judgement" ? (1) I can see how a judgement looping with a negation in the middle should be rejected as contradiction. (2) But looping with double negation is merely nondetermining isn't it? Examples (1) A = \+(A). (2) A = \+(\+(A)). yet both fail to unify with an occurs check in prolog. I think you need a deeper theory. Before you mention intuitionistic double negation vs classical: ?- unify_with_occurs_check(\+A, \+(\+(\+A))). false. of course. I should probably functionalise negation and see what's what. -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-18 19:36 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fj6v8$1v1c0$1@dont-email.me> |
| In reply to | #136034 |
On 11/18/2025 7:03 PM, Tristan Wibberley wrote:
> On 17/11/2025 22:59, olcott wrote:
>> On 11/17/2025 4:45 PM, Tristan Wibberley wrote:
>>> On 17/11/2025 22:15, Alan Mackenzie wrote:
>>>
>>>> There is no proper academic conversation to be had over 2 + 2 = 4.
>>>> It is
>>>> firm, unassailable knowledge, unchallengeable. The Halting Theorem
>>>> is of
>>>> the same status, proven using the same methodology from the same
>>>> fundamentals.
>>>
>>>
>>> It's a completely different league from 2 + 2 = 4.
>>> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder
>>> than that.
>>> It's more like the problem of whether a fixed point exists or not, but
>>> it's for the fixed point of a limit of a particular, conceptually weird,
>>> sequence of functions.
>>>
>>> It really is quite peculiar.
>>>
>>
>> Ultimately it is essentially the Liar Paradox in disguise.
>>
>> The Liar Paradox formalized in the Prolog Programming language
>>
>> This sentence is not true.
>> It is not true about what?
>> It is not true about being not true.
>> It is not true about being not true about what?
>> It is not true about being not true about being not true.
>> Oh I see you are stuck in a loop!
>>
>> This is formalized in the Prolog programming language below.
>>
>> ?- LP = not(true(LP)).
>> LP = not(true(LP)).
>> ?- unify_with_occurs_check(LP, not(true(LP))).
>> false.
>
> true/0
> use \+/1 rather than not/1
>
>
>> Failing an occurs check seems to mean that the
>> resolution of an expression remains stuck in an
> ^^^^^^^^^^
>> infinite loop.
>
> You mean "judgement" ?
I mean like this thingy:
void Infinite_Loop()
{
HERE: goto HERE;
return;
}
>
> (1) I can see how a judgement looping with a negation in the middle
> should be rejected as contradiction.
>
> (2) But looping with double negation is merely nondetermining isn't it?
>
Here is the same thing in Olcott's Minimal Type Theory
LP := ~True(LP) // A := B means A "is defined as" B
Directed Graph of evaluation sequence
00 ~ 01
01 True 00 // cycle
The directed graph of the evaluation sequence
has a cycle causing evaluation to be literally
stuck in an actual infinite loop just like the
C function.
In both cases the Liar Paradox is definitively
rejected as not a truth bearer just like the
sentence "What time is it?" cannot not possibly
be true or false.
>
> Examples
>
> (1) A = \+(A).
> (2) A = \+(\+(A)).
>
> yet both fail to unify with an occurs check in prolog. I think you need
> a deeper theory.
>
> Before you mention intuitionistic double negation vs classical:
>
> ?- unify_with_occurs_check(\+A, \+(\+(\+A))).
> false.
>
> of course.
>
> I should probably functionalise negation and see what's what.
>
> --
> Tristan Wibberley
>
> The message body is Copyright (C) 2025 Tristan Wibberley except
> citations and quotations noted. All Rights Reserved except that you may,
> of course, cite it academically giving credit to me, distribute it
> verbatim as part of a usenet system or its archives, and use it to
> promote my greatness and general superiority without misrepresentation
> of my opinions other than my opinion of my greatness and general
> superiority which you _may_ misrepresent. You definitely MAY NOT train
> any production AI system with it but you may train experimental AI that
> will only be used for evaluation of the AI methods it implements.
>
--
Copyright 2025 Olcott
My 28 year goal has been to make
"true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-19 18:51 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fl3k3$2d0vq$7@dont-email.me> |
| In reply to | #136038 |
On 19/11/2025 01:36, olcott wrote:
> On 11/18/2025 7:03 PM, Tristan Wibberley wrote:
>> On 17/11/2025 22:59, olcott wrote:
>>> On 11/17/2025 4:45 PM, Tristan Wibberley wrote:
>>>> On 17/11/2025 22:15, Alan Mackenzie wrote:
>>>>
>>>>> There is no proper academic conversation to be had over 2 + 2 = 4.
>>>>> It is
>>>>> firm, unassailable knowledge, unchallengeable. The Halting Theorem
>>>>> is of
>>>>> the same status, proven using the same methodology from the same
>>>>> fundamentals.
>>>>
>>>>
>>>> It's a completely different league from 2 + 2 = 4.
>>>> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder
>>>> than that.
>>>> It's more like the problem of whether a fixed point exists or not, but
>>>> it's for the fixed point of a limit of a particular, conceptually
>>>> weird,
>>>> sequence of functions.
>>>>
>>>> It really is quite peculiar.
>>>>
>>>
>>> Ultimately it is essentially the Liar Paradox in disguise.
>>>
>>> The Liar Paradox formalized in the Prolog Programming language
>>>
>>> This sentence is not true.
>>> It is not true about what?
>>> It is not true about being not true.
>>> It is not true about being not true about what?
>>> It is not true about being not true about being not true.
>>> Oh I see you are stuck in a loop!
>>>
>>> This is formalized in the Prolog programming language below.
>>>
>>> ?- LP = not(true(LP)).
>>> LP = not(true(LP)).
>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>> false.
>>
>> true/0
>> use \+/1 rather than not/1
>>
>>
>>> Failing an occurs check seems to mean that the
>>> resolution of an expression remains stuck in an
>> ^^^^^^^^^^
>>> infinite loop.
>>
>> You mean "judgement" ?
>
> I mean like this thingy:
>
> void Infinite_Loop()
> {
> HERE: goto HERE;
> return;
> }
Ah the terminological problem of what to call something like a
"normalisation" process when it might be that no normal form exists.
In the pure functional world your C characterisation is typically called
"a computation" but I'm not sure where the boundary lies or whether you
really mean "judgement" or "evaluation". In the C world "evaluation" of
"Infinite_Loop()" is a real thing that exists, even if the expression
has no value or any normal form in any conventionally reasonable
formalisation and the mapping of your original terms to Infinite_Loop is
just one choice for how to judge.
--
Tristan Wibberley
The message body is Copyright (C) 2025 Tristan Wibberley except
citations and quotations noted. All Rights Reserved except that you may,
of course, cite it academically giving credit to me, distribute it
verbatim as part of a usenet system or its archives, and use it to
promote my greatness and general superiority without misrepresentation
of my opinions other than my opinion of my greatness and general
superiority which you _may_ misrepresent. You definitely MAY NOT train
any production AI system with it but you may train experimental AI that
will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-19 14:22 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fl8uf$2gdi4$1@dont-email.me> |
| In reply to | #136107 |
On 11/19/2025 12:51 PM, Tristan Wibberley wrote:
> On 19/11/2025 01:36, olcott wrote:
>> On 11/18/2025 7:03 PM, Tristan Wibberley wrote:
>>> On 17/11/2025 22:59, olcott wrote:
>>>> On 11/17/2025 4:45 PM, Tristan Wibberley wrote:
>>>>> On 17/11/2025 22:15, Alan Mackenzie wrote:
>>>>>
>>>>>> There is no proper academic conversation to be had over 2 + 2 = 4.
>>>>>> It is
>>>>>> firm, unassailable knowledge, unchallengeable. The Halting Theorem
>>>>>> is of
>>>>>> the same status, proven using the same methodology from the same
>>>>>> fundamentals.
>>>>>
>>>>>
>>>>> It's a completely different league from 2 + 2 = 4.
>>>>> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder
>>>>> than that.
>>>>> It's more like the problem of whether a fixed point exists or not, but
>>>>> it's for the fixed point of a limit of a particular, conceptually
>>>>> weird,
>>>>> sequence of functions.
>>>>>
>>>>> It really is quite peculiar.
>>>>>
>>>>
>>>> Ultimately it is essentially the Liar Paradox in disguise.
>>>>
>>>> The Liar Paradox formalized in the Prolog Programming language
>>>>
>>>> This sentence is not true.
>>>> It is not true about what?
>>>> It is not true about being not true.
>>>> It is not true about being not true about what?
>>>> It is not true about being not true about being not true.
>>>> Oh I see you are stuck in a loop!
>>>>
>>>> This is formalized in the Prolog programming language below.
>>>>
>>>> ?- LP = not(true(LP)).
>>>> LP = not(true(LP)).
>>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>>> false.
>>>
>>> true/0
>>> use \+/1 rather than not/1
>>>
>>>
>>>> Failing an occurs check seems to mean that the
>>>> resolution of an expression remains stuck in an
>>> ^^^^^^^^^^
>>>> infinite loop.
>>>
>>> You mean "judgement" ?
>>
>> I mean like this thingy:
>>
>> void Infinite_Loop()
>> {
>> HERE: goto HERE;
>> return;
>> }
>
> Ah the terminological problem of what to call something like a
> "normalisation" process when it might be that no normal form exists.
>
> In the pure functional world your C characterisation is typically called
> "a computation" but I'm not sure where the boundary lies or whether you
> really mean "judgement" or "evaluation". In the C world "evaluation" of
> "Infinite_Loop()" is a real thing that exists, even if the expression
> has no value or any normal form in any conventionally reasonable
> formalisation and the mapping of your original terms to Infinite_Loop is
> just one choice for how to judge.
>
When you fully understand every nuance of my terms
then you understand that when the directed graph
of the evaluation sequence of a formal expression
contains a cycle that this proves that this expression
is semantically unsound because the evaluation of
this expression does have an actual infinite loop
just like this one.
void Infinite_Loop()
{
HERE: goto HERE;
return;
}
>
> --
> Tristan Wibberley
>
> The message body is Copyright (C) 2025 Tristan Wibberley except
> citations and quotations noted. All Rights Reserved except that you may,
> of course, cite it academically giving credit to me, distribute it
> verbatim as part of a usenet system or its archives, and use it to
> promote my greatness and general superiority without misrepresentation
> of my opinions other than my opinion of my greatness and general
> superiority which you _may_ misrepresent. You definitely MAY NOT train
> any production AI system with it but you may train experimental AI that
> will only be used for evaluation of the AI methods it implements.
>
--
Copyright 2025 Olcott
My 28 year goal has been to make
"true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Date | 2025-11-19 20:55 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <20251119123727.934@kylheku.com> |
| In reply to | #136118 |
On 2025-11-19, olcott <polcott333@gmail.com> wrote:
> On 11/19/2025 12:51 PM, Tristan Wibberley wrote:
>> On 19/11/2025 01:36, olcott wrote:
>>> On 11/18/2025 7:03 PM, Tristan Wibberley wrote:
>>>> On 17/11/2025 22:59, olcott wrote:
>>>>> On 11/17/2025 4:45 PM, Tristan Wibberley wrote:
>>>>>> On 17/11/2025 22:15, Alan Mackenzie wrote:
>>>>>>
>>>>>>> There is no proper academic conversation to be had over 2 + 2 = 4.
>>>>>>> It is
>>>>>>> firm, unassailable knowledge, unchallengeable. The Halting Theorem
>>>>>>> is of
>>>>>>> the same status, proven using the same methodology from the same
>>>>>>> fundamentals.
>>>>>>
>>>>>>
>>>>>> It's a completely different league from 2 + 2 = 4.
>>>>>> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder
>>>>>> than that.
>>>>>> It's more like the problem of whether a fixed point exists or not, but
>>>>>> it's for the fixed point of a limit of a particular, conceptually
>>>>>> weird,
>>>>>> sequence of functions.
>>>>>>
>>>>>> It really is quite peculiar.
>>>>>>
>>>>>
>>>>> Ultimately it is essentially the Liar Paradox in disguise.
>>>>>
>>>>> The Liar Paradox formalized in the Prolog Programming language
>>>>>
>>>>> This sentence is not true.
>>>>> It is not true about what?
>>>>> It is not true about being not true.
>>>>> It is not true about being not true about what?
>>>>> It is not true about being not true about being not true.
>>>>> Oh I see you are stuck in a loop!
>>>>>
>>>>> This is formalized in the Prolog programming language below.
>>>>>
>>>>> ?- LP = not(true(LP)).
>>>>> LP = not(true(LP)).
>>>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>>>> false.
>>>>
>>>> true/0
>>>> use \+/1 rather than not/1
>>>>
>>>>
>>>>> Failing an occurs check seems to mean that the
>>>>> resolution of an expression remains stuck in an
>>>> ^^^^^^^^^^
>>>>> infinite loop.
>>>>
>>>> You mean "judgement" ?
>>>
>>> I mean like this thingy:
>>>
>>> void Infinite_Loop()
>>> {
>>> HERE: goto HERE;
>>> return;
>>> }
>>
>> Ah the terminological problem of what to call something like a
>> "normalisation" process when it might be that no normal form exists.
>>
>> In the pure functional world your C characterisation is typically called
>> "a computation" but I'm not sure where the boundary lies or whether you
>> really mean "judgement" or "evaluation". In the C world "evaluation" of
>> "Infinite_Loop()" is a real thing that exists, even if the expression
>> has no value or any normal form in any conventionally reasonable
>> formalisation and the mapping of your original terms to Infinite_Loop is
>> just one choice for how to judge.
>>
>
> When you fully understand every nuance of my terms
> then you understand that when the directed graph
> of the evaluation sequence of a formal expression
> contains a cycle that this proves that this expression
> is semantically unsound because the evaluation of
> this expression does have an actual infinite loop
> just like this one.
Your three pages full of nothng, titled Minimal Type Theory,
don't contain anything original.
Programming language expression trees are directed graphs
already.
Long before you wrote that, it was possible to write the
Liar Paradox using Lisp, whose data notation supports a way of
introducing cycles into the graph:
#1=(not #1#)
That little expression is all it takes to show that the
self reference is not evaluatable.
Furthermore, in Lisp, we can readily model the equivalent
of "This sentence of has five words"; we can translate
it to a three-element expression which says "this expression
has three elements":
#1=(eql 3 (length '#1#)) ;; yields T
#1# refers back to the entire expression '#1# means (quote #1#):
it quotes it, creating an expression referring to the syntax
itself, rather than its value. (This is significant.)
Then length is applied to that syntax itself, producing 3,
which is EQL to 3, resulting in true.
Showing it more formally in Lisp this way shows the reason
that a paradox is avoided here. The key is that we had to
use the quote operator.
When a sentence talks about itself quoted, it is different
than when the sentence refers to its value.
A sentence could refer to the value of its quoted self with EVAL; then
that would be back to the liar paradox, like this:
#1=(not (eval '#1#))
But when the sentence grasps itself quoted, it doesn't have to evaluate.
Examining certain properties of itself other than its value does not
lead to infinite regress; for instance the number of terms in the
expression can be safely counted with LENGTH.
---
By the way, on a related note: under the CLISP implementation of
Common Lisp (and perhaps others) we can use STEP to simulate the
Liar paradox step by step and see the backtrace. CLISP's
implementation of STEP does not perform a full macro-expanson;
it expands incrementally so it is able to get into it:
We turn on printing of the Circle Notation, so we can print
the self-referential code:
[1]> (setf *print-circle* t)
T
Validate that printing it is now possible without stack overflow/reset:
[2]> (quote #1=(not #1#))
#1=(NOT #1#)
Now begin stepping:
[3]> (step #1=(not #1#))
step 1 --> #1=(NOT #1#)
Step 1 [4]> :s
step 2 --> #1=(NOT #1#)
Step 2 [5]> :s
step 3 --> #1=(NOT #1#)
Show the backtrace at this point: 14 frames are printed
Step 3 [6]> :bt
<1/214> #<SYSTEM-FUNCTION SHOW-STACK> 3
<2/207> #<COMPILED-FUNCTION SYSTEM::PRINT-BACKTRACE>
<3/201> #<COMPILED-FUNCTION SYSTEM::DEBUG-BACKTRACE>
<4/192> #<SYSTEM-FUNCTION SYSTEM::READ-EVAL-PRINT> 2
<5/189> #<COMPILED-FUNCTION SYSTEM::STEP-HOOK-FN-1-3>
<6/185> #<SYSTEM-FUNCTION SYSTEM::SAME-ENV-AS> 2
<7/171> #<COMPILED-FUNCTION SYSTEM::STEP-HOOK-FN-1>
<8/169> #<SYSTEM-FUNCTION SYSTEM::DRIVER>
<9/135> #<COMPILED-FUNCTION SYSTEM::STEP-HOOK-FN>
[128] EVAL frame for form #1=(NOT #1#)
[124] EVAL frame for form #1=(NOT #1#)
<10/114> #<SYSTEM-FUNCTION EVALHOOK>
<11/100> #<COMPILED-FUNCTION SYSTEM::STEP-HOOK-FN>
[93] EVAL frame for form #1=(NOT #1#)
[89] EVAL frame for form #1=(NOT #1#)
<12/79> #<SYSTEM-FUNCTION EVALHOOK>
<13/65> #<COMPILED-FUNCTION SYSTEM::STEP-HOOK-FN>
[58] EVAL frame for form #1=(NOT #1#)
<14/39> #<SPECIAL-OPERATOR LET*>
[37] EVAL frame for form (LET* ((SYSTEM::*STEP-LEVEL* 0) (SYSTEM::*STEP-QUIT* MOST-POSITIVE-FIXNUM) (SYSTEM::*STEP-WATCH* NIL) (*EVALHOOK* #'SYSTEM::STEP-HOOK-FN)) #1=(NOT #1#))
Printed 14 frames
Step one more:
Step 3 [6]> :s
step 4 --> #1=(NOT #1#)
Backtrace again, now there are 16 frames:
Step 4 [7]> :bt
<1/249> #<SYSTEM-FUNCTION SHOW-STACK> 3
<2/242> #<COMPILED-FUNCTION SYSTEM::PRINT-BACKTRACE>
<3/236> #<COMPILED-FUNCTION SYSTEM::DEBUG-BACKTRACE>
[ ... SNIP ... ]
Printed 16 frames
At every step, the current expression is #1=(NOT #1#): we are always back to
the same expression, because to evaluate (NOT X) we have to evaluate X and X is
#1# which is the same expression itself again.
--
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
Mastodon: @Kazinator@mstdn.ca
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-19 21:24 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fm1m0$2mm39$1@dont-email.me> |
| In reply to | #136128 |
On 11/19/2025 2:55 PM, Kaz Kylheku wrote:
> On 2025-11-19, olcott <polcott333@gmail.com> wrote:
>> On 11/19/2025 12:51 PM, Tristan Wibberley wrote:
>>> On 19/11/2025 01:36, olcott wrote:
>>>> On 11/18/2025 7:03 PM, Tristan Wibberley wrote:
>>>>> On 17/11/2025 22:59, olcott wrote:
>>>>>> On 11/17/2025 4:45 PM, Tristan Wibberley wrote:
>>>>>>> On 17/11/2025 22:15, Alan Mackenzie wrote:
>>>>>>>
>>>>>>>> There is no proper academic conversation to be had over 2 + 2 = 4.
>>>>>>>> It is
>>>>>>>> firm, unassailable knowledge, unchallengeable. The Halting Theorem
>>>>>>>> is of
>>>>>>>> the same status, proven using the same methodology from the same
>>>>>>>> fundamentals.
>>>>>>>
>>>>>>>
>>>>>>> It's a completely different league from 2 + 2 = 4.
>>>>>>> It's closer to x = 1/2 + x/2 but it's still conceptually /much/ harder
>>>>>>> than that.
>>>>>>> It's more like the problem of whether a fixed point exists or not, but
>>>>>>> it's for the fixed point of a limit of a particular, conceptually
>>>>>>> weird,
>>>>>>> sequence of functions.
>>>>>>>
>>>>>>> It really is quite peculiar.
>>>>>>>
>>>>>>
>>>>>> Ultimately it is essentially the Liar Paradox in disguise.
>>>>>>
>>>>>> The Liar Paradox formalized in the Prolog Programming language
>>>>>>
>>>>>> This sentence is not true.
>>>>>> It is not true about what?
>>>>>> It is not true about being not true.
>>>>>> It is not true about being not true about what?
>>>>>> It is not true about being not true about being not true.
>>>>>> Oh I see you are stuck in a loop!
>>>>>>
>>>>>> This is formalized in the Prolog programming language below.
>>>>>>
>>>>>> ?- LP = not(true(LP)).
>>>>>> LP = not(true(LP)).
>>>>>> ?- unify_with_occurs_check(LP, not(true(LP))).
>>>>>> false.
>>>>>
>>>>> true/0
>>>>> use \+/1 rather than not/1
>>>>>
>>>>>
>>>>>> Failing an occurs check seems to mean that the
>>>>>> resolution of an expression remains stuck in an
>>>>> ^^^^^^^^^^
>>>>>> infinite loop.
>>>>>
>>>>> You mean "judgement" ?
>>>>
>>>> I mean like this thingy:
>>>>
>>>> void Infinite_Loop()
>>>> {
>>>> HERE: goto HERE;
>>>> return;
>>>> }
>>>
>>> Ah the terminological problem of what to call something like a
>>> "normalisation" process when it might be that no normal form exists.
>>>
>>> In the pure functional world your C characterisation is typically called
>>> "a computation" but I'm not sure where the boundary lies or whether you
>>> really mean "judgement" or "evaluation". In the C world "evaluation" of
>>> "Infinite_Loop()" is a real thing that exists, even if the expression
>>> has no value or any normal form in any conventionally reasonable
>>> formalisation and the mapping of your original terms to Infinite_Loop is
>>> just one choice for how to judge.
>>>
>>
>> When you fully understand every nuance of my terms
>> then you understand that when the directed graph
>> of the evaluation sequence of a formal expression
>> contains a cycle that this proves that this expression
>> is semantically unsound because the evaluation of
>> this expression does have an actual infinite loop
>> just like this one.
>
> Your three pages full of nothng, titled Minimal Type Theory,
> don't contain anything original.
>
It directly encodes self-reference that no other
formal system has ever done and has a provability
operator directly in the language.
G := (F ⊬ G) // G "is defined as" unprovable in F
LP := ~True(LP) // LP "is defined as" not true
--
Copyright 2025 Olcott
My 28 year goal has been to make
"true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Date | 2025-11-20 04:46 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <20251119204312.52@kylheku.com> |
| In reply to | #136159 |
On 2025-11-20, olcott <polcott333@gmail.com> wrote: > On 11/19/2025 2:55 PM, Kaz Kylheku wrote: >> Your three pages full of nothng, titled Minimal Type Theory, >> don't contain anything original. >> > > It directly encodes self-reference that no other > formal system has ever done and has a provability > operator directly in the language. LOL, what? > > G := (F ⊬ G) // G "is defined as" unprovable in F > LP := ~True(LP) // LP "is defined as" not true Anyone can invent syntax. O := (O ᴀ G) // O is defined as off-topic asshole in newsgroup G -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal Mastodon: @Kazinator@mstdn.ca
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-19 22:58 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fm75b$2npt1$2@dont-email.me> |
| In reply to | #136163 |
On 11/19/2025 10:46 PM, Kaz Kylheku wrote: > On 2025-11-20, olcott <polcott333@gmail.com> wrote: >> On 11/19/2025 2:55 PM, Kaz Kylheku wrote: >>> Your three pages full of nothng, titled Minimal Type Theory, >>> don't contain anything original. >>> >> >> It directly encodes self-reference that no other >> formal system has ever done and has a provability >> operator directly in the language. > > LOL, what? >> >> G := (F ⊬ G) // G "is defined as" unprovable in F >> LP := ~True(LP) // LP "is defined as" not true > > Anyone can invent syntax. > > O := (O ᴀ G) // O is defined as off-topic asshole in newsgroup G > G := (F ⊬ G) // it take Godel 85 pages to say that -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-20 08:06 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fmi6m$2phq9$3@dont-email.me> |
| In reply to | #136165 |
On 20/11/2025 04:58, olcott wrote: > G := (F ⊬ G) // it take Godel 85 pages to say that If that's actually what he says then he's wrong. G is /not/ so defined! Perhaps he hallucinated that he so-defined G instead of merely mentioned it in the mention of a derivation of absurdity. -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-22 08:12 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fsgbr$gj30$2@dont-email.me> |
| In reply to | #136169 |
On 11/20/2025 2:06 AM, Tristan Wibberley wrote: > On 20/11/2025 04:58, olcott wrote: > >> G := (F ⊬ G) // it take Godel 85 pages to say that > > > If that's actually what he says then he's wrong. > > G is /not/ so defined! > ...We are therefore confronted with a proposition which asserts its own unprovability. 15 … (Gödel 1931:40-41) Gödel, Kurt 1931. On Formally Undecidable Propositions of Principia Mathematica And Related Systems > Perhaps he hallucinated that he so-defined G instead of merely mentioned > it in the mention of a derivation of absurdity. > > -- > Tristan Wibberley > > The message body is Copyright (C) 2025 Tristan Wibberley except > citations and quotations noted. All Rights Reserved except that you may, > of course, cite it academically giving credit to me, distribute it > verbatim as part of a usenet system or its archives, and use it to > promote my greatness and general superiority without misrepresentation > of my opinions other than my opinion of my greatness and general > superiority which you _may_ misrepresent. You definitely MAY NOT train > any production AI system with it but you may train experimental AI that > will only be used for evaluation of the AI methods it implements. > -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | dbush <dbush.mobile@gmail.com> |
|---|---|
| Date | 2025-11-22 10:15 -0500 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fsk23$h2p0$1@dont-email.me> |
| In reply to | #136265 |
On 11/22/2025 9:12 AM, olcott wrote: > On 11/20/2025 2:06 AM, Tristan Wibberley wrote: >> On 20/11/2025 04:58, olcott wrote: >> >>> G := (F ⊬ G) // it take Godel 85 pages to say that >> >> >> If that's actually what he says then he's wrong. >> >> G is /not/ so defined! >> > > ...We are therefore confronted with a proposition which asserts its own > unprovability. 15 … (Gödel 1931:40-41) > > Gödel, Kurt 1931. > On Formally Undecidable Propositions of Principia Mathematica And > Related Systems > The above is a non-normative comment which is not part of the actual proof, used to help the reader understand the steps of the proof. Godel's actual G has the *property* that it is both true and unprovable (i.e. that there is no finite series of steps from the axioms of the system that show it is true) without directly saying so. It has a form similar to M below: M := ~Ex x>5 and x<3 The above refutes the above use of Godel's quote to support your position. Repeating the above quote would therefore be a repeat of a previously refuted point which is less than no rebuttal and thus your admission that any point it is used to respond to is correct. >> Perhaps he hallucinated that he so-defined G instead of merely mentioned >> it in the mention of a derivation of absurdity. >> >> -- >> Tristan Wibberley >> >> The message body is Copyright (C) 2025 Tristan Wibberley except >> citations and quotations noted. All Rights Reserved except that you may, >> of course, cite it academically giving credit to me, distribute it >> verbatim as part of a usenet system or its archives, and use it to >> promote my greatness and general superiority without misrepresentation >> of my opinions other than my opinion of my greatness and general >> superiority which you _may_ misrepresent. You definitely MAY NOT train >> any production AI system with it but you may train experimental AI that >> will only be used for evaluation of the AI methods it implements. >> > >
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-22 18:42 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10ft071$mrin$1@dont-email.me> |
| In reply to | #136265 |
On 22/11/2025 14:12, olcott wrote: > On 11/20/2025 2:06 AM, Tristan Wibberley wrote: >> On 20/11/2025 04:58, olcott wrote: >> >>> G := (F ⊬ G) // it take Godel 85 pages to say that >> >> >> If that's actually what he says then he's wrong. >> >> G is /not/ so defined! >> > > ...We are therefore confronted with a proposition which asserts its own > unprovability. 15 … (Gödel 1931:40-41) That doesn't quote him saying G := (F ⊬ G). If he says that definitional proposition is so then he says it elsewhere. -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-22 13:06 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10ft1jj$o2nb$1@dont-email.me> |
| In reply to | #136280 |
On 11/22/2025 12:42 PM, Tristan Wibberley wrote: > On 22/11/2025 14:12, olcott wrote: >> On 11/20/2025 2:06 AM, Tristan Wibberley wrote: >>> On 20/11/2025 04:58, olcott wrote: >>> >>>> G := (F ⊬ G) // it take Godel 85 pages to say that >>> >>> >>> If that's actually what he says then he's wrong. >>> >>> G is /not/ so defined! >>> >> >> ...We are therefore confronted with a proposition which asserts its own >> unprovability. 15 … (Gödel 1931:40-41) > The := symbol is from Olcott's Minimal Type theory A := B means A is defined as B, thus enables direct self-reference. G := (F ⊬ G) In English G says that itself is unprovable in F. > That doesn't quote him saying G := (F ⊬ G). If he says that definitional > proposition is so then he says it elsewhere. > > -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-20 20:49 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fnurv$37027$1@dont-email.me> |
| In reply to | #136159 |
On 20/11/2025 03:24, olcott wrote: > On 11/19/2025 2:55 PM, Kaz Kylheku wrote: >> Your three pages full of nothng, titled Minimal Type Theory, >> don't contain anything original. >> > > It directly encodes self-reference that no other > formal system has ever done Uhh, no, it's typical. -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-21 13:50 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fqfpa$3ul8g$1@dont-email.me> |
| In reply to | #136192 |
On 11/20/2025 2:49 PM, Tristan Wibberley wrote: > On 20/11/2025 03:24, olcott wrote: >> On 11/19/2025 2:55 PM, Kaz Kylheku wrote: >>> Your three pages full of nothng, titled Minimal Type Theory, >>> don't contain anything original. >>> >> >> It directly encodes self-reference that no other >> formal system has ever done > > Uhh, no, it's typical. > > Provide a concrete example of: "This sentence is not true" in First Order Logic or any other system besides Minimal Type Theory and Prolog. -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Date | 2025-11-21 22:05 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <20251121140534.925@kylheku.com> |
| In reply to | #136234 |
On 2025-11-21, olcott <polcott333@gmail.com> wrote: > On 11/20/2025 2:49 PM, Tristan Wibberley wrote: >> On 20/11/2025 03:24, olcott wrote: >>> On 11/19/2025 2:55 PM, Kaz Kylheku wrote: >>>> Your three pages full of nothng, titled Minimal Type Theory, >>>> don't contain anything original. >>>> >>> >>> It directly encodes self-reference that no other >>> formal system has ever done >> >> Uhh, no, it's typical. >> >> > > Provide a concrete example of: > "This sentence is not true" > in First Order Logic or any other system > besides Minimal Type Theory and Prolog. ANSI Common Lisp: #1=(not #1#) -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal Mastodon: @Kazinator@mstdn.ca
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-19 02:47 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fjb3o$1vrgd$1@dont-email.me> |
| In reply to | #136034 |
On 19/11/2025 01:03, Tristan Wibberley wrote: > I should probably functionalise negation and see what's what. errr... defunctionalise the evaluation of negation ... -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | olcott <polcott333@gmail.com> |
|---|---|
| Date | 2025-11-18 21:04 -0600 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fjc4c$201kv$1@dont-email.me> |
| In reply to | #136042 |
On 11/18/2025 8:47 PM, Tristan Wibberley wrote: > On 19/11/2025 01:03, Tristan Wibberley wrote: > >> I should probably functionalise negation and see what's what. > > > errr... defunctionalise the evaluation of negation ... > > LP := ~True(LP) // A := B means A "is defined as" B Directed Graph of evaluation sequence 00 ~ 01 01 True 00 // cycle Simply realize that the Liar Paradox is stuck in an infinite evaluation loop proving that it can't possibly be true or false. > -- > Tristan Wibberley > > The message body is Copyright (C) 2025 Tristan Wibberley except > citations and quotations noted. All Rights Reserved except that you may, > of course, cite it academically giving credit to me, distribute it > verbatim as part of a usenet system or its archives, and use it to > promote my greatness and general superiority without misrepresentation > of my opinions other than my opinion of my greatness and general > superiority which you _may_ misrepresent. You definitely MAY NOT train > any production AI system with it but you may train experimental AI that > will only be used for evaluation of the AI methods it implements. > -- Copyright 2025 Olcott My 28 year goal has been to make "true on the basis of meaning" computable.
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-21 01:14 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10foeea$3brbt$1@dont-email.me> |
| In reply to | #135913 |
On 17/11/2025 22:59, olcott wrote: > Ultimately it is essentially the Liar Paradox in disguise. Yes, it is, I'm pretty sure (I haven't gone through it in such detail to satisfy all audiences). It's roughly evaluation of the contradictory G (as defined by Olcott in an inconsistent suppositional axiom extension) as opposed to judgement of that defining axiom (where judgement would be evaluation in a partiality monad instead of directly or in the identity monad). Where we have the craziness of nonstrict evaluation such as in Haskell, a partiality monad can be used for judgement and then used to construct evaluation using the monad's catamorphism with a simple empty loop. -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
| From | Tristan Wibberley <tristan.wibberley+netnews2@alumni.manchester.ac.uk> |
|---|---|
| Date | 2025-11-21 01:28 +0000 |
| Subject | Re: The halting problem is merely the Liar Paradox in disguise |
| Message-ID | <10fof7m$3brbt$2@dont-email.me> |
| In reply to | #136208 |
On 21/11/2025 01:14, Tristan Wibberley wrote: > On 17/11/2025 22:59, olcott wrote: > >> Ultimately it is essentially the Liar Paradox in disguise. > > Yes, it is, I'm pretty sure (I haven't gone through it in such detail to > satisfy all audiences). > > It's roughly evaluation of the contradictory G (as defined by Olcott in > an inconsistent suppositional axiom extension) as opposed to judgement > of that defining axiom (where judgement would be evaluation in a > partiality monad instead of directly or in the identity monad). > > Where we have the craziness of nonstrict evaluation such as in Haskell, > a partiality monad can be used for judgement and then used to construct > evaluation using the monad's catamorphism with a simple empty loop. For clarity, the "disguise" is obviously that a purported universal decider is constructed of many of the same elements using a partiality monad for judgements and combining them to what is "the universal decider with what would be uniquely identifying characteristics if it exists" I think the catamorphism is required to complete the disguise because the universal halting decider would be an infinite loop inside the monad and to match the liar paradox it has to be merged with the empty case on application of its catamorphism. Obviously there are so many identities among the ways of couching these things that it must be that the halting problem is the liar paradox in disguise. It's interesting to explore how and how far removed are they (not really very far). -- Tristan Wibberley The message body is Copyright (C) 2025 Tristan Wibberley except citations and quotations noted. All Rights Reserved except that you may, of course, cite it academically giving credit to me, distribute it verbatim as part of a usenet system or its archives, and use it to promote my greatness and general superiority without misrepresentation of my opinions other than my opinion of my greatness and general superiority which you _may_ misrepresent. You definitely MAY NOT train any production AI system with it but you may train experimental AI that will only be used for evaluation of the AI methods it implements.
[toc] | [prev] | [next] | [standalone]
Page 14 of 23 — ← Prev page 1 … 12 13 [14] 15 16 … 23 Next page →
Back to top | Article view | comp.theory
csiph-web