Overview of On Symbolically Computable Systems
The most apt characterization of SCS 0.3 in the whitepaper is:
Conceptual research paper and paradigm proposal for symbolic computational systems: SCS 0.3.
The policy defines a new research topic, terminology, result space, architecture, and research program.
A Conceptual Framework and Paradigm Proposal for Epistemically Open Systemic Computation
Although the outline is conceptually precise, it is not yet formally complete. The next separate, upcoming step will define the syntax, semantics, inference rules, and provable properties.
Comparison to Turing’s groundbreaking paper that created the computer
Turing’s 1936 paper operationally defined the computable number using a machine and symbolic steps, leading to the universal machine and the limits of undecidability. It was a mathematical construct and a proof paper. Turing’s original paper
| Perspective | Turing 1936 | SCS / GoodReason 2026 |
|---|---|---|
| Basic question | What can be calculated mechanically? | When can a system be symbolically treated in a justified manner? |
| Basic entity | Machine, tape, space and symbol | SOI, MOI, symbols, context, actors and feedback loops |
| Result | Calculated value or undecidability | answer, refuted, openorconflict |
| Importance | The semantics of the target area are abstracted away | Meaning, origin, purpose and interpretation are part of the model |
| Imperfection | Mathematical limit of calculation | Also the boundary between data, model, context and actors |
| Sociality | Not included in the machine model | Multi-agency and divergent interpretations are key |
What they have in common, above all, is the method : an indefinite human ability is transformed into an object of research defined by symbols, states, and permitted operations. In both, finding the limit is also part of the theory, not a failure.
The essential difference is that SCS does not extend the mathematical class of Turing-computable functions. It extends the object to be modeled and the outcome contract. When a solution cannot be formed, open(q,C,M)it preserves the question, context, and justification as usable data objects. This creates a good design:
While Turing defined when computation can continue, SCS further defines how research can continue when the answer cannot yet be computed or accepted.
In the GoodReason ring model, this is particularly true at watershed 4. Turing shows that not everything can be solved. SCS makes this boundary functional: openness, contradiction, and uncertainty are passed on to subsequent actors rather than being masked by an apparent answer.
Turing–Moore–GoodReason continuum
I think such a historical continuum can be found:
- Turing 1936 – possibility: what can a symbolic machine do in principle?
- Moore 1965 – capacity: how much computing can be technically and economically implemented?
- GoodReason/SCS 2026 – Understandability and Control: How to turn enormous computing capacity into reasoned, open and systemically usable information?
Moore’s original article was a techno-economic forecast of component count and cost trends, not a computability theorem. Moore’s original article
1. Turing made computability definable.
2. Moore made computation abundant.
3. GoodReason aims to make computational abundance understandable, justified, and systemically manageable.
This could be called the Turing–Moore–GoodReason continuum , but not yet a “law” of GoodReason. A true Moore’s Law-like claim would require a measurable quantity and an observable trend. A possible future quantity could be, for example, the number of verified symbolic reasoning steps relative to cost, energy, or human control.
After the limits of computation and computational capacity, the next big question concerns the management of meaning, justification, and systemic consequences.
The project has been developed by Eki Laitila starting from the Symbolic Analysis dissertation (University of Jyväskylä, 2008) as a GoodReason concept, which modern artificial intelligence has successfully helped in recent years thanks to the α – Ω architecture. Pilot presentation was held in the ISSS 2026 conference in Cyprus: link https://journals.isss.org/index.php/jisss/article/view/4627/1356.
Prototypes have been created by Ville Laitila.