question
active
question:what-are-the-analogues-to-turing-completeness-and-universality-when-we-are-concerned-with-processes-and-their-behavioursWhat are the analogues to Turing-completeness and universality when we are concerned with processes and their behaviours?
Key open problem: foundational definitions for process models that match the role of Turing completeness for functional computation.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Key open question linking mechanistic interpretability universality to machine consciousness
- Mere copying of tokens between paired positions suffices to simulate all partial recursive functions and model higher-order logics.
- Argues that sequence linkages reflect deep necessity, not option, for the system to work.
- The Geometry of Interaction model shows that simple copying of information between locations suffices for all computation, establishing emergent logic.
- Paper's extension of Olah's Universality Hypothesis to the domain of consciousness
- Paper's interpretation of Gödel's incompleteness result as motivating computationalism
- Load-bearing quote from SICP framing computation as spirit-like; grounds the cyberanimism framework
- A summary generalization from the examples about the nature of living processes.