Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
| From | Kaz Kylheku <643-408-1753@kylheku.com> |
|---|---|
| Newsgroups | comp.theory, sci.logic, comp.ai.philosophy, sci.math |
| Subject | Re: Making true on the basis of meaning computable from finite strings |
| Date | 2025-11-08 21:48 +0000 |
| Organization | A noiseless patient Spider |
| Message-ID | <20251108133916.861@kylheku.com> (permalink) |
| References | <10eo35b$2p4b0$1@dont-email.me> |
Cross-posted to 4 groups.
On 2025-11-08, olcott <polcott333@gmail.com> wrote: > ChatGPT 5.0 fully evaluated all of the details of A clever writer recently dubbed LLM AI "Dunning-Kruger as a Service". https://christianheilmann.com/2025/10/30/ai-is-dunning-kruger-as-a-service/ I immediately thought o Olcott; one of the worst cases of Dunning-Kruger Syndrome in existence. A Dunning-Kruger case swearing by the output of an automated Dunning-Kruger service; what surprise there! -- TXR Programming Language: http://nongnu.org/txr Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal Mastodon: @Kazinator@mstdn.ca
Back to sci.math | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-08 12:46 -0600
Re: Making true on the basis of meaning computable from finite strings Kaz Kylheku <643-408-1753@kylheku.com> - 2025-11-08 21:48 +0000
Re: Making true on the basis of meaning computable from finite strings olcott <polcott333@gmail.com> - 2025-11-08 16:41 -0600
Re: Making true on the basis of meaning computable from finite strings "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-08 15:23 -0800
Re: Making true on the basis of meaning computable from finite strings "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2025-11-08 15:26 -0800
csiph-web