{"_self":{"principle":"Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.","widget":"article_topology","feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","contains":"claims, sources, anecdotes, question_graph slice","slug":"convergence-encyclopedia-part-3-schools-info","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/topology"},"how_to_use":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","write":null,"imessage":null,"router_tag":null,"proof_chain":[{"step":1,"claim":"Articles are voxel graphs of tiered claims, not prose blobs.","verify":"https://miscsubjects.com/api/articles/constitution"},{"step":2,"claim":"Claims link to hash-chained sources via source_ids.","verify":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/sources"},{"step":3,"claim":"Ask reads topology; ingest/claim append to ledger.","verify":"https://miscsubjects.com/api/protocol"},{"step":4,"claim":"Models queue growth: populate → collaborate → repair → reflex.","verify":"https://miscsubjects.com/api/protocol/grow"},{"step":5,"claim":"Graph proves its own shape (reflex) and $/claim (yield).","verify":"https://miscsubjects.com/graph.html?layer=reflex"},{"step":6,"claim":"Full feature index + _explain on every API response.","verify":"https://miscsubjects.com/api/articles/system-map"}],"related_features":[{"id":"ask","name":"Ask protocol","what":"Answer only from topology; creates question_node with gaps and ingest_hint.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/prompts","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"graph_topology","name":"Cross-article graph","what":"Merged claims/sources across condition+stack slugs for one question.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/graph-topology?question=..."}},{"id":"question_graph","name":"Question graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output).","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/question-graph","write":"https://miscsubjects.com/api/protocol/ask"}},{"id":"voxels","name":"Voxel graph","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance.","urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/voxels","write":"https://miscsubjects.com/api/protocol/claim"}}],"system_map":"https://miscsubjects.com/api/articles/system-map","system_map_markdown":"https://miscsubjects.com/api/articles/system-map?format=markdown","not_medical_advice":true},"_explain":{"feature":"topology","name":"Article topology","what":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","why":"Every feature is auditable collective intelligence","how":"Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER.","model":null,"verifies":null,"urls":{"read":"https://miscsubjects.com/api/articles/convergence-encyclopedia-part-3-schools-info/topology"},"imessage":null,"router":null,"related":[{"id":"ask","what":"Answer only from topology; creates question_node with gaps and ingest_hint."},{"id":"graph_topology","what":"Merged claims/sources across condition+stack slugs for one question."},{"id":"question_graph","what":"Ask nodes (questions + gaps) and evidence_ingest nodes (pasted model output)."},{"id":"voxels","what":"Claims as atoms, sources as edges (supported_by, posted_by). Per-claim provenance."}],"not_medical_advice":true},"slug":"convergence-encyclopedia-part-3-schools-info","title":"Convergence Encyclopedia: The Schools — Information, Systems & Philosophy","register":"oip_protocol","tags":["OIP","convergence-encyclopedia","encyclopedia"],"updated_at":"2026-07-04T05:01:11.389Z","body_excerpt":"## PART 3: THE SCHOOLS — INFORMATION, SYSTEMS & PHILOSOPHY\n\n## 3.1 Information Theory & Computation\n\nClassical Information Theory\n\n•\tFounder(s): Claude Shannon (“A Mathematical Theory of Communication,” Bell System Technical Journal, 1948); Warren Weaver (popularization, 1949); later: Thomas Cover & Joy Thomas (Elements of Information Theory, 1991)\n•\tCore claim: Information can be quantified in bits; the fundamental limits of communication (channel capacity) and compression (source coding) are determined by entropy\n•\tConvergence patterns: C06 (entropy = information — Shannon’s H is formally identical to Boltzmann’s S), C07 (feedback: error-correcting codes use feedback to maintain fidelity), C11 (networks: communication channels as information networks)\n•\tIndependence check: Independent — Shannon was at Bell Labs solving telephone-switching problems. No connection to physics or biology in the original formulation\n•\tClaim tier: T0 — channel capacity theorem and source coding theorem are mathematical theorems. Applications (compression, encryption) confirm daily\n•\tKey tension: Shannon information is syntactic (structure) not semantic (meaning). The theory says nothing about what information means. This limits application to biology and cognition\n•\tCanonical text: Shannon, “A Mathematical Theory of Communication” (1948), Part I on discrete noiseless systems\n\nAlgorithmic Information Theory\n\n•\tFounder(s): Andrey Kolmogorov (“Three Approaches to the Quantitative Definition of Information,” 1965); Ray Solomonoff (“A Formal Theory of Inductive Inference,” 1964); Gregory Chaitin (“On the Length of Programs for Computing Finite Binary Sequences,” 1966; Ω number, 1975)\n•\tCore claim: The information content of an object is the length of the shortest program that produces it on a universal computer; randomness is algorithmic incompressibility\n•\tConvergence patterns: C06 (algorithmic information as the intrinsic information content), C08 (self-reference: Chaitin’s Ω is definable but uncomputable — a Gödelian limit), C20 (universal computation: the definition requires Turing machines)\n•\tIndependence check: Independent — Kolmogorov was a Soviet probabilist; Solomonoff was an American AI researcher; Chaitin was a teenager in Argentina and then IBM Research. Three independent origins\n•\tClaim tier: T0 — Kolmogorov complexity is well-defined; incompressibility and randomness are formally linked. The uncomputability of K(x) is proven. Applications (compression, machine learning) are T1\n•\tKey tension: Kolmogorov complexity is uncomputable — no algorithm can compute it for all strings. This creates a permanent gap between theory and practice. Also: the choice of universal Turing machine affects complexity by only an additive constant, but “only” hides practical concerns\n•\tCanonical text: Li & Vitányi, An Introduction to Kolmogorov Complexity and Its Applications (3rd ed., 2008), Ch. 1-2 on definitions and basic properties\n\nComputation Theory\n\n•\tFounder(s): Alan Turing (“On Computable Numbers,” 1936); Alonzo Church (λ-calculus, 1936); John von Neumann (von Neumann architecture, 1945; self-replicating automata, 1966)\n•\tCore claim: There is a maximally general model of computation (Turing machine); some problems are undecidable; physical computers can be universal\n•\tConvergence patterns: C20 (universal computation: Turing-complete systems can simulate any other), C08 (self-reference: halting problem via diagonalization), C06 (information: computability as information processing), C12 (von Neumann’s self-replicating automata as autopoiesis)\n•\tIndependence check: Turing solved Hilbert’s Entscheidungsproblem; Church invented λ-calculus for logic; von Neumann designed computers and then abstracted to self-replication. Three independent paths\n•\tClaim tier: T0 — Church-Turing thesis is widely accepted; undecidability is proven. Physical confirmation: all known computing models are Turing-equivalent\n•\tKey tension: The Extended Church-Turing thesis (efficient ","ranking":"safety-first (interaction_risk/limitations), then quote-gated effective_weight","claims":[],"sources":[],"anecdotal_sources":[],"scientific_sources":[],"user_reports":[],"related_articles":[],"question_graph":{"slug":"convergence-encyclopedia-part-3-schools-info","questions":[],"evidence":[],"edges":[],"counts":{"questions":0,"evidence":0,"edges":0}},"honesty":{"active_claims":0,"retracted_claims":0,"cut_claims":0,"challenges":0,"scrub_events":0,"note":"Retracted/cut claims stay on ledger but are excluded from ask unless ?include_inactive=1"},"counts":{"claims":0,"claims_total":0,"sources":0,"anecdotal":0,"scientific":0,"user_reports":0,"questions":0,"evidence_ingests":0}}