Why the Universe Appears Computable Without Being Computational

This paper addresses the widespread intuition that the universe may be fundamentally computational, an intuition motivated by the success of algorithmic and simulation-based descriptions across physics, biology, and cosmology. It demonstrates that this intuition arises from a category error. Within the $\psi_0$–OCM (Osborne Cosmological Model), computation is shown to be a derived descriptive property of stabilized closure states rather than a generative mechanism of physical origin. Once redistribution dynamics eliminate dominant loss channels, persistent structures admit abstraction into states, rules, and transitions, making them appear algorithmic. However, the closure process that generates existence itself is non-computational and cannot be reduced to predefined state spaces, update rules, or stepwise execution. This distinction explains both the effectiveness and the limits of computational models of nature, clarifying why reality appears computable without being computational in origin.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-02-10
DOI
https://doi.org/10.5281/zenodo.18602674
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Why the Universe Appears Computable Without Being Computational

John Francis Osborne
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
article

Why the Universe Appears Computable Without Being Computational

John Francis Osborne
article en

Abstract

This paper addresses the widespread intuition that the universe may be fundamentally computational, an intuition motivated by the success of algorithmic and simulation-based descriptions across physics, biology, and cosmology. It demonstrates that this intuition arises from a category error. Within the $\psi_0$–OCM (Osborne Cosmological Model), computation is shown to be a derived descriptive property of stabilized closure states rather than a generative mechanism of physical origin. Once redistribution dynamics eliminate dominant loss channels, persistent structures admit abstraction into states, rules, and transitions, making them appear algorithmic. However, the closure process that generates existence itself is non-computational and cannot be reduced to predefined state spaces, update rules, or stepwise execution. This distinction explains both the effectiveness and the limits of computational models of nature, clarifying why reality appears computable without being computational in origin.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 59%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.