Follow how observations become reusable states, explanations, and methods that can be checked and revised. The book connects representation and memory with inference, learning, and shared reasoning.
Start here Contents PDF and source Work overview Start reading
Contents 97 chapters in 13 parts, with introductory pages, glossary, appendices, and references.
Introduction Preface Edition, provenance, and verification The Realization Setting Evidence, methods, and correction 1 From evidence to a reusable state 2 Operations must survive their representations 3 Memory that remains open to correction 4 From corrected records to decisions and explanations 5 One investigation, one resource budget 6 Improving discovery without changing its meaning 7 What remains valid after a revision 8 Shared work and maintained obligations 9 One finite reasoning chain Composition, control, and revision 10 A common contract for stochastic and legal operations 11 Preserving an ending strategy under safe continuation 12 Transporting safe continuation through a quotient 13 Changing a representation without losing correctability Proof and interpretation 14 Proof fields, closure, and executable certificates 15 Transporting derivations between languages 16 A finite language of executable methods 17 From checked claims to guarded execution 18 From the finite chain to the wider theory Komorebi Space: realization, obstruction, and repair 19 Realizations and their obstructions 20 Resolution, repair, and retained detail 21 Symmetry and effective descent 22 The geometry of exact realization 23 From approximation to exact realization 24 Worked realization problems Grounded abstraction and the limits of learning 25 Evidence before representation 26 New questions and the memory needed to correct them 27 Noisy evidence and quantitative justification 28 Grounded continuation without complete identification 29 Quantitative grounding with finite retained memory 30 A consolidated grounding contract Large Signal Model: realization and predictive inference 31 Realization and predictive closure 32 Learning, stability, and coherent expansion 33 Controlled stochastic realization 34 Certified probability domains and robust inference 35 Curved domains and continuous observations 36 Certificate discovery, approximation, and evidence 37 Robust curved certificates and noisy geometry 38 Data-supported domains and smaller repairs Nonlinear interaction quotients and Bayesian refinement 39 Interaction structure and exact nonlinear quotients 40 Analytic fields, rooted trees, and quotient flows 41 Positive observations and exact filtering 42 Dynamical and Bayesian approximation 43 Posterior certificates and hyperedge compression 44 Algorithms and worked nonlinear filters 45 Relations, limitations, and further problems Machine understanding and explanatory transfer 46 Representations and implemented use 47 Explanation, inquiry, and correction 48 Common witnesses and charged resources 49 Interpretation and scope Proof paths and mathematical memory 50 Proof fields and certificates 51 Coherent realization and information 52 Compression, representation, and memory 53 Revision, review, and inquiry 54 Examples, implementation, and boundaries Constructive repair and exact certificates 55 Correction, dimension, and admissibility 56 Faithful transport and exact search 57 Rational certificates and constructive attainment 58 Costed covers and proof-carrying branch search Self-improvement and the discovery of methods 59 The object that improves 60 Discovering and transporting repair 61 Improving the procedure that discovers repairs 62 Learning a compiler’s rejection rule 63 Improving how discovery rules are acquired 64 Keeping a revision’s guarantees applicable 65 Evidence and recursive continuation 66 A bounded route toward general intelligence Relational workspaces and distributed reasoning 67 Foundational thesis 68 Static core and transfer theory 69 Exact shared cores 70 Approximate workspaces 71 Gauge invariance and abstract identity 72 Dynamic workspace theory 73 Relational irreducibility 74 Causal efficacy and reentry 75 Formal workspace definition 76 Persistence 77 Reconstruction and resilience 78 Identity through time and replacement 79 Gluing and workspaces of workspaces 80 Scaffolded and endogenous formation 81 Boundary formation and stability 82 Agency, counterfactual control, and self-maintenance 83 Decomposition, coarse-graining, and robust relationality 84 Specification robustness, identifiability, and statistical certification 85 Summary of main results 86 Conjectures and open mathematical directions 87 Empirical certification and reporting protocol 88 Integrated worked examples and case studies 89 Relation to prior work 90 Theory hierarchy 91 Unified formulation 92 Discussion, limitations, and philosophical consequences Machine societies and accountable organization 93 Realization and abstraction 94 Institutions and collective choice 95 Continuity, compatibility, and knowledge 96 Authority and joint feasibility 97 Accountability and the limits of persistence Glossary, appendices, and references Glossary Result and source map KS: additional mathematical material GA: additional mathematical material MU: additional mathematical material SII: additional mathematical material MS: additional mathematical material PRIQ: additional mathematical material PPT: additional mathematical material Large Signal Model: proof and evidence register Large Signal Model: visual atlas KS: references GA: references MU: references SII: references MS: references LSM: references PRIQ: references PPT: references CR: references SRWT: references Edition and source notes 