1. Title Page
2. Preface
3. Reader's Guide & Conventions
7. Part I: Mathematical Foundations
8. 1. Chapter 1: Information as Lawful Structure
9. 2. Chapter 2: The Universal Automaton
10. 3. Chapter 3: Intrinsic Labels, Schedules, and Receipts
11. 4. Chapter 4: Content-Addressable Memory
15. Part II: Algebraic Structure
16. 5. Chapter 5: Lawfulness as a Type System
17. 6. Chapter 6: Programs as Geometry
18. 7. Chapter 7: Algorithmic Reification
19. 8. Chapter 8: The Universal Cost
23. Part III: System Architecture
24. 9. Chapter 9: Security, Safety, and Correctness
25. 10. Chapter 10: Worked Micro-Examples
26. 11. Chapter 11: Interfaces to Mainstream CS
27. 12. Chapter 12: Minimal Core
31. Part IV: Protocol Design
32. 13. Chapter 13: Meta-Theory & Expressivity
33. 14. Chapter 14: Normalization & Confluence
34. 15. Chapter 15: Categorical Semantics
35. 16. Chapter 16: Security Proofs
39. Part V: Implementation
40. 17. Chapter 17: Optimization Landscape
41. 18. Chapter 18: Data Structure Implementation
42. 19. Chapter 19: Runtime Architecture
43. 20. Chapter 20: Verification System
47. Part VI: Applications
48. 21. Chapter 21: Distributed Systems
49. 22. Chapter 22: Database Systems
50. 23. Chapter 23: Compiler Construction
51. 24. Chapter 24: Machine Learning Integration
55. Appendices
56. 25. Appendix A: Glossary
57. 26. Appendix B: Mathematical Notation
58. 27. Appendix C: Side-by-Side CS Mappings
59. 28. Appendix D: Exercise Solutions
60. 29. Appendix E: Implementation Code
61. 30. Appendix F: Research Problems
64. Bibliography
65. Index