concept
active
concept:halting-problem

Halting Problem

Undecidability of whether an arbitrary program halts, discussed as a self-referential limit of computation.

Neighborhood — ranked by edge-count

Thinkers (1)

thinker
  • Alan Turing
    introduces
    Computer scientist who anticipated the symmetry between morphogenesis and cognition as early as 1952 in his chemical theory of morphogenesis.

Concepts (2)

concept
  • Russell's Paradox
    analogous_to
    Set of all sets not containing themselves; central example motivating avoidance-based mathematical foundations.
  • Shows formal systems with self-reference must be incomplete; analogized to Turing's halting problem.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

  • Alignment Problemconcept0.762
    The problem of ensuring AI systems adopt values compatible with human welfare — argued to be a perennial problem already present in child-rearing
  • The process of moving through configuration space towards a goal; self-organisation as navigation
  • The question of how competent small-scale agents bind into a unified larger Self.
  • Bootstrap Problemconcept0.742
    The problem of how an unorganized substrate can build coherent models of reality using only its own activity; consciousness is proposed as the solution
  • Gaming Problemconcept0.740
    The risk that any indicator merely correlated with consciousness can be artificially implemented without the system actually being conscious
  • Question prompting the audience to identify the primary degradation symptoms (riverscape degradation, structural starvation).
  • Proposed constitutional article defining mindful reflection steps in CCAI implementation
  • Closingmethod0.721
    Dynamic condition: ending a branch or closing a frame.