Finding Mind

Bibliography

  1. 1
    L.G. Meredith and M. Radestock. A reflective higher-order calculus. In Proceedings of ETAPS/FOSSACS, 2005.
  2. 2
    J.J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Proceedings of CONCUR 2000, LNCS 1877, pp. 243–258, 2000.
  3. 3
    D.T. Gillespie. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry, 81(25):2340–2361, 1977.
  4. 4
    Y. Cao, J. Lu, and Y. Lu. Quantum Gillespie algorithm and related methods for open quantum systems. Preprint, 2021. (See also: Breuer & Petruccione, The Theory of Open Quantum Systems, OUP.)
  5. 5
    V. Danos and J. Krivine. Reversible communicating systems. In Proceedings of CONCUR 2004, LNCS 3170, pp. 292–307, 2004.
  6. 6
    L. Bombelli, J. Lee, D. Meyer, and R.D. Sorkin. Space-time as a causal set. Physical Review Letters, 59(5):521–524, 1987.
  7. 7
    S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51(1–2):1–77, 1991.
  8. 8
    R. Fagin, J.Y. Halpern, Y. Moses, and M.Y. Vardi. Reasoning About Knowledge. MIT Press, 1995.
  9. 9
    A. Hatcher. Algebraic Topology. Cambridge University Press, 2002.
  10. 10
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.
  11. 11
    K.G. Wilson and J. Kogut. The renormalization group and the \(\epsilon\) expansion. Physics Reports, 12(2):75–199, 1974.
  12. 12
    A.M. Turing. Systems of logic based on ordinals. Proceedings of the London Mathematical Society, 45(1):161–228, 1939.
  13. 13
    R.S. Sutton and A.G. Barto. Reinforcement Learning: An Introduction. 2nd edition. MIT Press, 2018.
  14. 14
    M. Solms. The Hidden Spring: A Journey to the Source of Consciousness. Profile Books / W.W. Norton, 2021.
  15. 15
    L.W. Buss. The Evolution of Individuality. Princeton University Press, 1987.
  16. 16
    J. von Neumann. Theory of Self-Reproducing Automata. Edited and completed by A.W. Burks. University of Illinois Press, 1966.
  17. 17
    K. Friston. The free-energy principle: a unified brain theory? Nature Reviews Neuroscience, 11(2):127–138, 2010.
  18. 18
    G. Tononi. Consciousness as integrated information: a provisional manifesto. Biological Bulletin, 215(3):216–242, 2008.
  19. 19
    L. Cronin and S. Walker. Assembly theory explains and quantifies selection and evolution. Nature, 622:321–328, 2023.
  20. 20
    E. Smith and H.J. Morowitz. The Origin and Nature of Life on Earth: The Emergence of the Fourth Geosphere. Cambridge University Press, 2016.
  21. 21
    A. Regev, W. Silverman, and E. Shapiro. Representation and simulation of biochemical processes using the \(\pi\)-calculus process algebra. Pacific Symposium on Biocomputing, 6:459–470, 2001.
  22. 22
    L. G. Meredith. Knots as cost-accounted rholang processes: a Dowker–Thistlethwaite-driven encoding and weak-bisimulation invariance. F1R3FLY.io, 2026.
  23. 23
    L. G. Meredith. Classifying knot diagrams with a spatial–behavioural logic: a logic obtained for free from the encoding of knots as processes. F1R3FLY.io, 2026.
  24. 24
    Graph-structured lambda theories: a reference for the working developer. F1R3FLY.io, 2026.
  25. 25
    L. G. Meredith. Probing universality: context-labelled bisimulation and a relative refinement of Turing completeness for interactive GSLTs. F1R3FLY.io, 2026.
  26. 26
    L. G. Meredith. Every constructor an interaction: observer extensions, and the discriminating power of spatial formulae in interactive graph-structured lambda theories. F1R3FLY.io, 2026. Second version, revised in response to referee comments.
  27. 27
    C. B. Wells, M. Stay and L. G. Meredith. Behavior in higher-order languages: admissible observers, relative pushouts, and the encoding of extended theories. F1R3FLY.io, 2026. In preparation.
  28. 28
    E. Lozes. Expressivit\’e des logiques spatiales. Th\‘ese de doctorat, ENS Lyon, 2004.
  29. 29
    D. Hirschkoff, \’E. Lozes and D. Sangiorgi. Minimality results for the spatial logics. In FSTTCS, LNCS 2914, Springer, 2003.
  30. 30
    L. G. Meredith. Cost accounting as a monad for continued graph-structured lambda theories. F1R3FLY.io, 2026.
  31. 31
    L. G. Meredith. History as an endofunctor. F1R3FLY.io, 2026.
  32. 32
    L. G. Meredith. Weighted graph-structured lambda theories: stochastic and quantum execution for MeTTaIL, with a spiking recurrent network as a worked example. F1R3FLY.io, 2026. Second version, revised in response to referee comments.
  33. 33
    C. Priami. Stochastic \(\pi\)-calculus. The Computer Journal 38(7):578–589, 1995.
  34. 34
    A. Phillips and L. Cardelli. A correct abstract machine for the stochastic pi-calculus. In Bioconcur, 2004.
  35. 35
    W. S. McCulloch and W. Pitts. A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics 5:115–133, 1943.
  36. 36
    D. O. Hebb. The Organization of Behavior. Wiley, 1949.
  37. 37
    G. Bi and M. Poo. Synaptic modifications in cultured hippocampal neurons. Journal of Neuroscience 18(24):10464–10472, 1998.
  38. 38
    L. G. Meredith. Splitting the mind of Zeus: realizability, collection monads, and the choice content of the McBride derivative in a finite-limits metalanguage. F1R3FLY.io, 2026.
  39. 39
    L. G. Meredith and M. Radestock. Namespace logic: a logic for a reflective higher-order calculus. In Trustworthy Global Computing, LNCS 3705, Springer, 2005.
  40. 40
    L. G. Meredith and M. Radestock. A reflective higher-order calculus. Electronic Notes in Theoretical Computer Science 141(5):49–67, 2005.
  41. 41
    Operational semantics in logical form (OSLF): a family of algorithms auto-generating logics and type systems from graph-structured lambda theories.
  42. 42
    R. Cleaveland. On automatically explaining bisimulation inequivalence. In Computer Aided Verification (CAV), LNCS 531, Springer, 1990.
  43. 43
    L. Caires. Behavioral and spatial observations in a logic for the pi-calculus. In Foundations of Software Science and Computation Structures (FoSSaCS), LNCS 2987, Springer, 2004.
  44. 44
    L. Caires and L. Cardelli. A spatial logic for concurrency (part I). Information and Computation 186(2):194–235, 2003.
  45. 45
    R. Milner. Functions as processes. Mathematical Structures in Computer Science 2(2):119–141, 1992.
  46. 46
    G. D. Plotkin. A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60–61:17–139, 2004.
  47. 47
    E. P. Wigner. The unreasonable effectiveness of mathematics in the natural sciences. Communications on Pure and Applied Mathematics 13(1):1–14, 1960.
  48. 48
    R. W. Hamming. The unreasonable effectiveness of mathematics. The American Mathematical Monthly 87(2):81–90, 1980.
  49. 49
    R. Landauer. Irreversibility and heat generation in the computing process. IBM Journal of Research and Development 5(3):183–191, 1961.
  50. 50
    G. Hinton. The forward-forward algorithm: some preliminary investigations, 2022. (Mortal computation.)
  51. 51
    D. Noble. Dance to the Tune of Life: Biological Relativity. Cambridge University Press, 2016.
  52. 52
    E. Smith and H. J. Morowitz. The Origin and Nature of Life on Earth: The Emergence of the Fourth Geosphere. Cambridge University Press, 2016.
  53. 53
    D. T. Gillespie. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry 81(25):2340–2361, 1977.
  54. 54
    A. Newell and H. A. Simon. Human Problem Solving. Prentice-Hall, 1972.
  55. 55
    C. L. Bouton. Nim, a game with a complete mathematical theory. Annals of Mathematics 3(1/4):35–39, 1901–1902.
  56. 56
    J. H. Conway. On Numbers and Games. Academic Press, 1976.
  57. 57
    G. Hardin. The competitive exclusion principle. Science 131(3409):1292–1297, 1960.
  58. 58
    D. Tilman. Resource Competition and Community Structure. Princeton University Press, 1982.
  59. 59
    L. Margulis. Origin of Eukaryotic Cells. Yale University Press, 1970.
  60. 60
    F1R3FLY.io, Compression versus Autonomy: an error-theoretic account of an architectural crossover common to biology, silicon, and distributed systems, research note, 2026-05-25.
  61. 61
    F1R3FLY.io, Cost-accounted rho calculus, research note, 2026.
  62. 62
    F1R3FLY.io, The cost endofunctor on continued interactive GSLTs, research note, 2026.
  63. 63
    F1R3FLY.io, The Virtual Token: no-arbitrage, conversion, and the cost-accounted transport of energy, research note, 2026.
  64. 64
    F1R3FLY.io, Financial contracts in the cost-accounted rho calculus, research note, 2026.
  65. 65
    F1R3FLY.io, Mortal computation, research note, 2026.
  66. 66
    S. Peyton Jones, J.-M. Eber, J. Seward, Composing contracts: an adventure in financial engineering, ICFP 2000.
  67. 67
    R. M. Foster, The average impedance of an electrical network, in Contributions to Applied Mechanics, 1949, pp. 333–340.
  68. 68
    S. Hoory, N. Linial, A. Wigderson, Expander graphs and their applications, Bull. AMS 43(4):439–561, 2006.
  69. 69
    R. L. Lindeman, The trophic-dynamic aspect of ecology, Ecology 23(4):399–417, 1942.
  70. 70
    R. No\"e, P. Hammerstein, Biological markets: supply and demand determine the effect of partner choice in cooperation, mutualism and mating, Behavioral Ecology and Sociobiology 35:1–11, 1994.
  71. 71
    E. T. Kiers et al., Reciprocal rewards stabilize cooperation in the mycorrhizal symbiosis, Science 333:880–882, 2011.
  72. 72
    G. B. West, J. H. Brown, B. J. Enquist, A general model for the origin of allometric scaling laws in biology, Science 276:122–126, 1997.
  73. 73
    R. H. Coase, The nature of the firm, Economica 4(16):386–405, 1937.
  74. 74
    R. Hanson, D. Martin, C. McCarter, J. Paulson, If loud aliens explain human earliness, quiet aliens are also rare, The Astrophysical Journal 922:182, 2021.
  75. 75
    L. G. Meredith. Quoting is Colour-Swap: a model of the rho calculus in the category of bags. F1R3FLY.io research note, 2026.
  76. 76
    L. G. Meredith. Paths are Subspaces: a cut-triggered polymorphism of RSpace. F1R3FLY.io research note, 2026.
  77. 77
    L. G. Meredith. From the Axiom of Choice to Fair Scheduling: toward a Curry–Howard correspondence for nondeterminism, in which choice principles are the types and fair schedulers are the terms. F1R3FLY.io research note, June 2026.
  78. 78
    L. G. Meredith. A Knotted Universe: a new notion of reflective set theories. F1R3FLY.io research note, 2026.
  79. 79
    V. Brattka, G. Gherardi, and A. Pauly. Weihrauch complexity in computable analysis. In Handbook of Computability and Complexity in Analysis, Springer, 2021.
  80. 80
    R. I. Soare. Turing Computability: Theory and Applications. Springer, 2016.
  81. 81
    B. J. Copeland. Hypercomputation. Minds and Machines, 12(4):461–502, 2002.
  82. 82
    J. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In CONCUR 2000, LNCS 1877, pp. 243–258, 2000.
  83. 83
    P. Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1–2):183–230, 2002.
  84. 84
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.
  85. 85
    J. J. M. M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):3–80, 2000.
  86. 86
    D. Turi and G. Plotkin. Towards a mathematical operational semantics. In LICS 1997, pp. 280–291, 1997.
  87. 87
    P. Aczel. Non-Well-Founded Sets, CSLI Lecture Notes 14. CSLI Publications, 1988.
  88. 88
    J. S. Bell. On the Einstein Podolsky Rosen paradox. Physics Physique Fizika, 1(3):195–200, 1964.
  89. 89
    B. Hensen et al. Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature, 526:682–686, 2015.
  90. 90
    N. Brunner, D. Cavalcanti, S. Pironio, V. Scarani, and S. Wehner. Bell nonlocality. Reviews of Modern Physics, 86(2):419–478, 2014.
  91. 91
    S. Abramsky and A. Brandenburger. The sheaf-theoretic structure of non-locality and contextuality. New Journal of Physics, 13:113036, 2011.
  92. 92
    L. G. Meredith. From Coalition Logic to Rho Calculus: toward a Curry–Howard correspondence for consensus protocol synthesis. F1R3FLY.io research note, 2026.
  93. 93
    P. Martin-L\"of. Intuitionistic Type Theory. Bibliopolis, Naples, 1984.
  94. 94
    C. Spector. Provably recursive functionals of analysis. In Recursive Function Theory, Proc. Symp. Pure Math. V, pp. 1–27. AMS, 1962.
  95. 95
    S. Berardi, M. Bezem, and T. Coquand. On the computational content of the axiom of choice. Journal of Symbolic Logic, 63(2):600–622, 1998.
  96. 96
    J.-L. Krivine. Dependent choice, ‘quote’ and the clock. Theoretical Computer Science, 308(1–3):259–276, 2003.
  97. 97
    M. H. Escard\’o and P. Oliva. Selection functions, bar recursion and backward induction. Mathematical Structures in Computer Science, 20(2):127–168, 2010.
  98. 98
    N. Francez. Fairness. Texts and Monographs in Computer Science. Springer, 1986.
  99. 99
    S. Abramsky. Proofs as processes. Theoretical Computer Science, 135(1):5–9, 1994.
  100. 100
    G. Bellin and P. J. Scott. On the \(\pi\)-calculus and linear logic. Theoretical Computer Science, 135(1):11–65, 1994.
  101. 101
    L. Caires and F. Pfenning. Session types as intuitionistic linear propositions. In CONCUR 2010, LNCS 6269, pp. 222–236. Springer, 2010.
  102. 102
    P. Wadler. Propositions as sessions. Journal of Functional Programming, 24(2–3):384–418, 2014.
  103. 103
    R. Diaconescu. Axiom of choice and complementation. Proceedings of the AMS, 51:176–178, 1975.
  104. 104
    E. Noether, Invariante Variationsprobleme, Nachrichten von der Gesellschaft der Wissenschaften zu G\"ottingen, Mathematisch-Physikalische Klasse, 1918, pp. 235–257.
  105. 105
    L.-H. Lim, Hodge Laplacians on graphs, SIAM Review 62(3), 2020, pp. 685–715.
  106. 106
    C. H. Bennett, The thermodynamics of computation — a review, International Journal of Theoretical Physics 21(12), 1982, pp. 905–940.
  107. 107
    M. S. Miller, Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control, PhD thesis, Johns Hopkins University, 2006.
  108. 108
    F1R3FLY.io, Two erasures and two laxities: cost, history, and internalisation in continued interactive GSLTs, research note, 2026.
  109. 109
    I. Kant, Prolegomena to Any Future Metaphysics That Will Be Able to Come Forward as Science, 1783. Translated by G. Hatfield, Cambridge University Press, revised edition, 2004.
  110. 110
    I. Kant, Critique of Pure Reason, 1781 (A) / 1787 (B). Translated by P. Guyer and A. W. Wood, Cambridge University Press, 1998.
  111. 111
    G. Huet. The zipper. Journal of Functional Programming, 7(5):549–554, 1997.
  112. 112
    C. McBride. Clowns to the left of me, jokers to the right: dissecting data structures. In Proceedings of POPL 2008, pp. 287–295, 2008.
  113. 113
    L.G. Meredith and M. Radestock, A calculus from outer space, research note, F1R3FLY.io.
  114. 114
    S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Deductive Program Design, Springer, 1996.
  115. 115
    J. Baez and C. Williams. Enriched Lawvere theories for operational semantics. Electronic Proceedings in Theoretical Computer Science, 2020.
  116. 116
    H. Barendregt. Introduction to generalized type systems. Journal of Functional Programming, 1(2):125–154, 1991.
  117. 117
    L. Cardelli and A. D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177–213, 2000.
  118. 118
    N. G. de Bruijn. Lambda calculus notation with nameless dummies. Indagationes Mathematicae, 34:381–392, 1972.
  119. 119
    D. Kozen. Results on the propositional \(\mu\)-calculus. Theoretical Computer Science, 27(3):333–354, 1983.
  120. 120
    D. Sangiorgi and D. Walker. The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
  121. 121
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, 1985.
  122. 122
    J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic. Cambridge University Press, 1986.
  123. 123
    F. W. Lawvere. Functorial semantics of algebraic theories. PhD thesis, Columbia University, 1963.
  124. 124
    M. S. Miller, K.-P. Yee, and J. Shapiro. Capability myths demolished. Technical report, Johns Hopkins University, 2003.
  125. 125
    R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119–141, 1992.
  126. 126
    G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
  127. 127
    J. C. Reynolds. Separation logic: a logic for shared mutable data structures. In LICS, 2002.
  128. 128
    R. J. van Glabbeek. The linear time–branching time spectrum. In CONCUR, Springer, 1990.
  129. 129
    M. Abadi and C. Fournet. Mobile values, new names, and secure communication. POPL, 2001.
  130. 130
    M. Asai and A. Fukunaga. Classical planning in deep latent space: bridging the subsymbolic-symbolic boundary. AAAI, 2018.
  131. 131
    M. Asai and H. Kajino. Towards stable symbol grounding with zero-suppressed state autoencoder. ICAPS, 2019.
  132. 132
    G. Begus, M. Dabkowski, R. L. Sprouse, D. F. Gruber and S. Gero. The phonology of sperm whale coda vowels. Proceedings of the Royal Society B 293(2069):20252994, 2026.
  133. 133
    E. M. Bender and A. Koller. Climbing towards NLU: on meaning, form, and understanding in the age of data. ACL, 2020.
  134. 134
    J. Bengtson, M. Johansson, J. Parrow and B. Victor. Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science 7(1), 2011.
  135. 135
    Y. Bisk, A. Holtzman, J. Thomason, J. Andreas, Y. Bengio, J. Chai, M. Lapata, A. Lazaridou, J. May, A. Nisnevich, N. Pinto and J. Turian. Experience grounds language. EMNLP, 2020.
  136. 136
    P. S. Castro, T. Kastner, P. Panangaden and M. Rowland. MICo: improved representations via sampling-based state similarity for Markov decision processes. NeurIPS, 2021.
  137. 137
    On the theory of musical scores and its relation to work-performance. Estetika: The European Journal of Aesthetics, 2026.
  138. 138
    N. Ferns, P. Panangaden and D. Precup. Metrics for finite Markov decision processes. UAI, 2004.
  139. 139
    C. Gelada, S. Kumar, J. Buckman, O. Nachum and M. G. Bellemare. DeepMDP: learning continuous latent space models for representation learning. ICML, 2019.
  140. 140
    V. Goel. Notationality and the information processing mind. Minds and Machines 1(2):129–166, 1991.
  141. 141
    N. Goodman. Languages of Art: An Approach to a Theory of Symbols. Bobbs-Merrill, 1968; second edition Hackett, 1976.
  142. 142
    S. Harnad. The symbol grounding problem. Physica D 42:335–346, 1990.
  143. 143
    J. Luo, Y. Cao and R. Barzilay. Neural decipherment via minimum-cost flow: from Ugaritic to Linear B. ACL, 2019.
  144. 144
    J. Luo, F. Hartmann, E. Santus, Y. Cao and R. Barzilay. Deciphering undersegmented ancient scripts using phonetic prior. TACL, 2021.
  145. 145
    A. van den Oord, O. Vinyals and K. Kavukcuoglu. Neural discrete representation learning. NeurIPS, 2017.
  146. 146
    D. Pierce and B. J. Kuipers. Map learning with uninterpreted sensors and effectors. Artificial Intelligence 92:169–229, 1997.
  147. 147
    A. S. Shai, S. E. Marzen, L. Teixeira, A. Gietelink Oldenziel and P. M. Riechers. Transformers represent belief state geometry in their residual stream. NeurIPS, 2024.
  148. 148
    C. R. Shalizi and J. P. Crutchfield. Computational mechanics: pattern and prediction, structure and simplicity. Journal of Statistical Physics 104:817–879, 2001.
  149. 149
    P. Sharma, S. Gero, R. Payne, D. F. Gruber, D. Rus, A. Torralba and J. Andreas. Contextual and combinatorial structure in sperm whale vocalisations. Nature Communications 15:3617, 2024.
  150. 150
    L. Steels. The Talking Heads Experiment: Origins of Words and Meanings. Language Science Press, 2015.
  151. 151
    T. Taniguchi. Collective predictive coding hypothesis: symbol emergence as decentralized Bayesian inference. Frontiers in Robotics and AI 11:1353870, 2024.
  152. 152
    A. Zhang, R. McAllister, R. Calandra, Y. Gal and S. Levine. Learning invariant representations for reinforcement learning without reconstruction. ICLR, 2021.
  153. 153
    B. J. Baars. A Cognitive Theory of Consciousness. Cambridge University Press, 1988.
  154. 154
    D. J. Chalmers. The Conscious Mind: In Search of a Fundamental Theory. Oxford University Press, 1996.
  155. 155
    B. Coecke and A. Kissinger. Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press, 2017.
  156. 156
    S. M. Marshall, C. Mathis, E. Carrick, G. Keenan, G. J. T. Cooper, H. Graham, M. Craven, P. S. Gromski, D. G. Moore, S. I. Walker and L. Cronin. Identifying molecules as biosignatures with assembly theory and mass spectrometry. Nature Communications 12:3033, 2021.
  157. 157
    S. Dehaene and J.-P. Changeux. Experimental and theoretical approaches to conscious processing. Neuron 70(2):200–227, 2011.
  158. 158
    D. Deutsch. Constructor theory. Synthese 190(18):4331–4359, 2013.
  159. 159
    B. Fong and D. I. Spivak. An Invitation to Applied Category Theory: Seven Sketches in Compositionality. Cambridge University Press, 2019.
  160. 160
    B. Goertzel, A. Belayneh, M. Ikle’ and G. Sen Hazarika. OpenCog Hyperon: a framework for AGI at the human level and beyond. Preprint, 2023; see also B. Goertzel, The General Theory of General Intelligence, 2021.
  161. 161
    M. S. A. Graziano. Consciousness and the Social Brain. Oxford University Press, 2013.
  162. 162
    M. Hutter. Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability. Springer, 2005.
  163. 163
    S. Lloyd. Programming the Universe: A Quantum Computer Scientist Takes On the Cosmos. Knopf, 2006.
  164. 164
    C. Marletto. Constructor theory of life. Journal of the Royal Society Interface 12(104):20141226, 2015.
  165. 165
    H. R. Maturana and F. J. Varela. Autopoiesis and Cognition: The Realization of the Living. Reidel, 1980.
  166. 166
    T. Nagel. What is it like to be a bat? The Philosophical Review 83(4):435–450, 1974.
  167. 167
    R. Rosen. Life Itself: A Comprehensive Inquiry into the Nature, Origin, and Fabrication of Life. Columbia University Press, 1991.
  168. 168
    R. J. Solomonoff. A formal theory of inductive inference, parts I and II. Information and Control 7(1):1–22 and 7(2):224–254, 1964.
  169. 169
    A. Sharma, D. Czegel, M. Lachmann, C. P. Kempes, S. I. Walker and L. Cronin. Assembly theory explains and quantifies selection and evolution. Nature 622:321–328, 2023.
  170. 170
    J. A. Wheeler. Information, physics, quantum: the search for links. In Complexity, Entropy, and the Physics of Information, Addison-Wesley, 1990.
  171. 171
    S. Wolfram. A Project to Find the Fundamental Theory of Physics. Wolfram Media, 2020.
  172. 172
    S. Wolfram. The concept of the ruliad. Writings, 2021.
  173. 173
    J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communications of the ACM, 21(8):613–641, 1978.
  174. 174
    D. Woelk, P. Cannata, M. Huhns, W. Shen, C. Tomlinson. Using Carnot for enterprise information integration. Proc. Second International Conference on Parallel and Distributed Information Systems, 1993.
  175. 175
    N. Chomsky. Three models for the description of language. IRE Transactions on Information Theory, 2(3):113–124, 1956.
  176. 176
    N. Chomsky. Syntactic Structures. Mouton, 1957.
  177. 177
    N. Chomsky. Review of B. F. Skinner, Verbal Behavior. Language, 35(1):26–58, 1959.
  178. 178
    N. Chomsky. Aspects of the Theory of Syntax. MIT Press, 1965.
  179. 179
    A. Church. An unsolvable problem of elementary number theory. American Journal of Mathematics, 58(2):345–363, 1936.
  180. 180
    J. Clifford, G. Marcus (eds.). Writing Culture: The Poetics and Politics of Ethnography. University of California Press, 1986.
  181. 181
    L. Daston. Enlightenment calculations. Critical Inquiry, 21(1):182–202, 1994.
  182. 182
    J. des Rivi\‘eres, B. C. Smith. The implementation of procedurally reflective languages. Proc. ACM Symposium on LISP and Functional Programming, 1984.
  183. 183
    E. W. Dijkstra. Go to statement considered harmful. Communications of the ACM, 11(3):147–148, 1968.
  184. 184
    E. W. Dijkstra. The humble programmer. Communications of the ACM, 15(10):859–866, 1972.
  185. 185
    K. G\"odel. \"Uber formal unentscheidbare S\"atze der Principia Mathematica und verwandter Systeme I. Monatshefte f\"ur Mathematik und Physik, 38:173–198, 1931.
  186. 186
    D. A. Grier. When Computers Were Human. Princeton University Press, 2005.
  187. 187
    C. Hewitt, P. Bishop, R. Steiger. A universal modular ACTOR formalism for artificial intelligence. Proc. IJCAI, 1973.
  188. 188
    D. Hofstadter. G\"odel, Escher, Bach: An Eternal Golden Braid. Basic Books, 1979.
  189. 189
    G. Kiczales, J. des Rivi\‘eres, D. G. Bobrow. The Art of the Metaobject Protocol. MIT Press, 1991.
  190. 190
    G. Kiczales et al. Aspect-oriented programming. Proc. ECOOP, LNCS 1241, 1997.
  191. 191
    S. C. Kleene, J. B. Rosser. The inconsistency of certain formal logics. Annals of Mathematics, 36(3):630–636, 1935.
  192. 192
    H. Maturana, F. Varela. Autopoiesis and Cognition: The Realization of the Living. Reidel, 1980.
  193. 193
    J. McCarthy. Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM, 3(4):184–195, 1960.
  194. 194
    R. Milner. A Calculus of Communicating Systems. LNCS 92, Springer, 1980.
  195. 195
    R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1):1–40 and 41–77, 1992.
  196. 196
    R. Milner. Elements of interaction: Turing Award lecture. Communications of the ACM, 36(1):78–89, 1993.
  197. 197
    D. Park. Concurrency and automata on infinite sequences. Theoretical Computer Science, LNCS 104, 1981.
  198. 198
    C. A. Petri. Kommunikation mit Automaten. PhD thesis, University of Bonn, 1962.
  199. 199
    E. L. Post. Finite combinatory processes—formulation 1. Journal of Symbolic Logic, 1(3):103–105, 1936.
  200. 200
    E. L. Post. Formal reductions of the general combinatorial decision problem. American Journal of Mathematics, 65(2):197–215, 1943.
  201. 201
    M. Rabin, D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114–125, 1959.
  202. 202
    C. Tomlinson, M. Scheevel, V. Singh, et al. Report on Rosette 1.0. MCC Technical Report, Microelectronics and Computer Technology Corporation, 1991.
  203. 203
    A. Rosenblueth, N. Wiener, J. Bigelow. Behavior, purpose and teleology. Philosophy of Science, 10(1):18–24, 1943.
  204. 204
    B. C. Smith. Reflection and Semantics in a Procedural Language. PhD thesis, MIT, 1982.
  205. 205
    B. C. Smith. Reflection and semantics in LISP. Proc. 11th ACM Symposium on Principles of Programming Languages, 23–35, 1984.
  206. 206
    B. C. Smith. On the Origin of Objects. MIT Press, 1996.
  207. 207
    C. Tomlinson, V. Singh. Inheritance and synchronization with enabled-sets. Proc. OOPSLA, 1989.
  208. 208
    A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2–42:230–265, 1936.
  209. 209
    A. M. Turing. Intelligent machinery. National Physical Laboratory report, 1948.
  210. 210
    A. M. Turing. Computing machinery and intelligence. Mind, 59(236):433–460, 1950.
  211. 211
    H. von Foerster. Observing Systems. Intersystems Publications, 1981.
  212. 212
    J. von Neumann. First draft of a report on the EDVAC. Moore School of Electrical Engineering, University of Pennsylvania, 1945.
  213. 213
    J. von Neumann, O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
  214. 214
    P. Wegner. Why interaction is more powerful than algorithms. Communications of the ACM, 40(5):80–91, 1997.
  215. 215
    E. Barendsen, S. Smetsers. Uniqueness typing for functional languages with graph rewriting semantics. Mathematical Structures in Computer Science, 6(6):579–612, 1996.
  216. 216
    A. Blass. A game semantics for linear logic. Annals of Pure and Applied Logic, 56(1–3):183–220, 1992.
  217. 217
    G. Gentzen. Untersuchungen \"uber das logische Schlie{}en. Mathematische Zeitschrift, 39:176–210 and 405–431, 1935.
  218. 218
    J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1–102, 1987.
  219. 219
    K. Honda. Types for dyadic interaction. Proc. CONCUR, LNCS 715, 1993.
  220. 220
    W. A. Howard. The formulae-as-types notion of construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, 1980.
  221. 221
    R. Jung, J.-H. Jourdan, R. Krebbers, D. Dreyer. RustBelt: securing the foundations of the Rust programming language. Proc. POPL, 2018.
  222. 222
    J. Piaget. The Construction of Reality in the Child. Basic Books, 1954.
  223. 223
    P. Wadler. Linear types can change the world! In Programming Concepts and Methods, North-Holland, 1990.
  224. 224
    D. C. Dennett. Consciousness Explained. Little, Brown, 1991.
  225. 225
    C. von der Malsburg. The correlation theory of brain function. Internal report 81-2, Max Planck Institute for Biophysical Chemistry, 1981.
  226. 226
    A. Treisman, G. Gelade. A feature-integration theory of attention. Cognitive Psychology, 12(1):97–136, 1980.
  227. 227
    S. Abramsky, B. Coecke. A categorical semantics of quantum protocols. Proc. LICS, 2004.
  228. 228
    C. H. Bennett. Logical reversibility of computation. IBM Journal of Research and Development, 17(6):525–532, 1973.
  229. 229
    D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer. Proceedings of the Royal Society A, 400(1818):97–117, 1985.
  230. 230
    D. Deutsch. Quantum computational networks. Proceedings of the Royal Society A, 425(1868):73–90, 1989.
  231. 231
    R. P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21(6/7):467–488, 1982.
  232. 232
    M. Minsky, S. Papert. Perceptrons: An Introduction to Computational Geometry. MIT Press, 1969.
  233. 233
    A. K. Pati, S. L. Braunstein. Impossibility of deleting an unknown quantum state. Nature, 404:164–165, 2000.
  234. 234
    D. E. Rumelhart, J. L. McClelland, and the PDP Research Group. Parallel Distributed Processing. MIT Press, 1986.
  235. 235
    F. Rosenblatt. The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 65(6):386–408, 1958.
  236. 236
    D. E. Rumelhart, G. E. Hinton, R. J. Williams. Learning representations by back-propagating errors. Nature, 323:533–536, 1986.
  237. 237
    W. K. Wootters, W. H. Zurek. A single quantum cannot be cloned. Nature, 299:802–803, 1982.
  238. 238
    S. J. Gay, R. Nagarajan. Communicating quantum processes. Proc. POPL, 2005.
  239. 239
    Thomas Aquinas. Summa Theologiae, First Part, QQ. 50–64 (the treatise on angels); on irrevocability, Q. 63 and Q. 64, art. 2.
  240. 240
    C. S. Lewis. Out of the Silent Planet. John Lane, The Bodley Head, 1938. The sorn’s account of Oyarsa occurs in the Meldilorn chapters; cf. also Poems, ed. W. Hooper, Geoffrey Bles, 1964, for “On being human”.
  241. 241
    J. C. Baez, J. Master. Open Petri nets. Mathematical Structures in Computer Science, 30(3):314–341, 2020.
  242. 242
    J. Meseguer, U. Montanari. Petri nets are monoids. Information and Computation, 88(2):105–155, 1990.