Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #143309
| From | polcott <polcott333@gmail.com> |
|---|---|
| Newsgroups | comp.theory, sci.logic |
| Subject | Re: Happy Recovery |
| Date | 2026-08-15 08:32 -0500 |
| Message-ID | <115ppp1$gud7$1@solani.org> (permalink) |
| References | (5 earlier) <bzIfS.688690$yWz9.359834@fx04.ams4> <115o0va$fqor$1@solani.org> <9RSfS.54774$_cVb.28793@fx11.ams4> <115pf90$gn00$1@solani.org> <q1YfS.27530$2G1.10039@fx09.ams4> |
Cross-posted to 2 groups.
On 8/15/2026 6:26 AM, Johann 'Myrkraverk' Oskarsson wrote: > On 15/08/2026 6:33 PM, polcott wrote: >> On 8/15/2026 12:31 AM, Johann 'Myrkraverk' Oskarsson wrote: >>> On 15/08/2026 5:22 AM, polcott wrote: >>>> On 8/14/2026 12:49 PM, Johann 'Myrkraverk' Oskarsson wrote: >>>>> On 10/08/2026 9:26 PM, polcott wrote: >>>>>> >>>>>> If you understand what a directed acyclic graph >>>>>> is then you will understand how you are wrong. >>>>>> >>>>> Since you have all the knowledge, why don't you teach us how you >>>>> code directed acyclic graphs, in C? I mean, show code, and not >>>>> just spout theoretical nonsense. You say you're already recovered, >>>>> so this must be a simple task. >>>>> >>>>> Or at minimum, tell us exactly which graph library you'd use when >>>>> coding >>>>> graphs in C. >>>>> >>>>> >>>>> Best wishes, and happy coding in C! >>>> >>>> I would make a rooted directed acyclic graph using >>>> C++ std:vector with integer indices as the links >>>> between the nodes. >>>> >>>> A small subset of C++ is enormously better than C. >>>> I only use 2 or 3 std library functions and C++ >>>> classes/objects. >>> >>> In that case, I upstage you, you asshole, and create a circular list of >>> you in Common Lisp. >>> >> >> Disrespecting me gets you *plonked* or ignored. >> >>> (nconc polcott polcott) >>> >>> Because Common Lisp in infinitely superiour to C++, you fucking asshole. >>> >> >> Lisp is generally too slow compared to C++. >> The system that I propose is a production system >> requirng maximum performance to minimize hardware >> costs. >> >>> See, I didn't even need any /library function/, it's right there in the >>> fucking programming language! What do you think of that, you theoretic- >>> al asshole? >>> >>>> >>>> This last difference lets you divide up a a system >>>> into totally independent modules such that changes >>>> to one cannot possibly have any side-effects on and >>>> of the others. It makes system development much easier >>>> and much more reliable and has very little learning >>>> curve. I make sure to totally ignore all of the rest >>>> of C++. >>>> >>> >>> On the other hand, Common Lisp can have side effects everywhere, unlike >>> you, you Haskell licking slut! Do you think monads are something you >>> put on your food? Or do you suck monads all day long for your own plea- >>> sure? >> >> Side effects are bugs. >> > > I see. Please unplug you monitor. It has side effects, and is there- > fore buggy. You're unfit to post on Usenet, because you don't under- > stand that the machine has side effects. > > And never, ever re-plug your monitor. You're unfit to see what I post > on Usenet! > Containment (encapsulation) in C++ means that a unit of code (a class) holds its data and the operations that manipulate that data inside one protected structure. Its benefit is that it keeps the data safe from accidental misuse by forcing all access to go through the class’s own functions. In C, a struct holds only the data, and any part of the program can read or modify that data directly. All the rules for using the data are scattered across the codebase, so nothing prevents incorrect access, missed initialization, or broken usage patterns. This is the only aspect of the complex details of C++ that I have ever used. -- Copyright 2026 Olcott My 28 year goal has been to make "true on the basis of meaning expressed in language" reliably computable for the entire body of general knowledge. The complete structure of this system is now defined. The entire body of knowledge expressed in language is comprised of two types of relations between finite strings: (a) *Axioms* Expressions of language that are stipulated to be true. My system bridges the analytic/synthetic distinction by expressly encoding all empirical "atomic facts" in a formal language such as CycL of the Cyc project. (b) *Inference Rules* Expressions of language that are semantically entailed syntactically from (a) and/or (b).
Back to comp.theory | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
In the hospital with pneumonia for three weeks recovering at home on oxygen olcott <polcott333@gmail.com> - 2026-08-08 10:30 -0500
Happy Recovery (was: Re: In the hospital with pneumonia for three weeks recovering at home on oxygen) Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-09 02:20 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-08 16:13 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-10 05:40 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-09 18:07 -0500
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-10 13:13 -0700
Re: Happy Recovery "Fred. Zwarts" <F.Zwarts@HetNet.nl> - 2026-08-10 08:31 +0200
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-10 08:26 -0500
Re: Happy Recovery Ross Finlayson <ross.a.finlayson@gmail.com> - 2026-08-10 07:02 -0700
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-10 10:20 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-11 11:22 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-11 07:35 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-12 11:46 +0300
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-12 08:36 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-13 10:07 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-13 04:05 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 01:55 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-14 16:25 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 01:49 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-14 16:22 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 13:31 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 05:33 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 19:26 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 08:32 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-15 22:36 +0800
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-15 12:33 -0700
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-15 10:51 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-15 05:26 -0500
Re: Happy Recovery Mikko <mikko.levanto@iki.fi> - 2026-08-16 10:29 +0300
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-16 07:34 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-16 16:03 +0800
Re: Happy Recovery Alan Mackenzie <acm@muc.de> - 2026-08-16 12:52 +0000
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-16 21:20 +0800
Re: Happy Recovery polcott <polcott333@gmail.com> - 2026-08-21 12:36 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-22 02:17 +0800
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-21 15:02 -0500
Re: Happy Recovery Johann 'Myrkraverk' Oskarsson <johann@myrkraverk.invalid> - 2026-08-22 07:35 +0800
Re: Happy Recovery olcott <polcott333@gmail.com> - 2026-08-21 21:41 -0500
Re: Happy Recovery "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> - 2026-08-10 13:12 -0700
csiph-web