Languages that cannot be automatically evaluated inevitably contain unresolvable paradoxes; constructive computation avoids this by building representations over simple step-by-step operations.

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

• Algorithmic and yes-no thinking has destroyed subtle adaptive processes in real-world buildingclaim0.779
• Reductionist analysis is increasingly impossible for current and future machines, just as it is for living systems, because modern AI and swarm systems resist bottom-up explanation.claim0.778
  Argument that resistance to reductionism no longer distinguishes life from machines
• Today's Large Language Models have become so good at playing Turing's game that it often takes experts to demonstrate the present limits of their ability to simulate human-like intelligence.claim0.770
  Paper's assessment of current LLM capabilities relative to Turing Test
• a basic difficulty [of non-functional languages] is that they are very long winded, in terms of the amount one has to write to achieve a given effect.quote0.769
  From Turner (1982), cited to represent the functional programming community's view and then refuted.
• Software implementations for all of the models/behaviours presented are common for n = 2, and can be made very efficient for α_i that map many objects onto a much smaller set of object families.claim0.765
  Claim about current practical feasibility and efficiency of 2-way associative implementations.
• The interactive processes described are reversible in a very strong sense, linking logic and physicsclaim0.765
  Partial involutions are invertible; the same structures can axiomatize quantum mechanics and analyse entanglement.
• Modern machines, including quantum computers and machine learning systems, achieve reliable function through uncertain events, making unpredictability a feature rather than a defect.claim0.765
  Argument that predictability is no longer an essential property distinguishing machines from life
• What are the analogues to Turing-completeness and universality when we are concerned with processes and their behaviours?question0.764
  Key open problem: foundational definitions for process models that match the role of Turing completeness for functional computation.