Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1207.1033

Alan Turing's Legacy: Info-Computational Philosophy of Nature

Gordana Dodig-Crnkovic
View original source ↗Read source document ↗Export metadata ↓

Abstract

Alan Turing's pioneering work on computability, and his ideas on morphological computing support Andrew Hodges' view of Turing as a natural philosopher. Turing's natural philosophy differs importantly from Galileo's view that the book of nature is written in the language of mathematics (The Assayer, 1623). Computing is more than a language of nature as computation produces real time physical behaviors. This article presents the framework of Natural Info-computationalism as a contemporary natural philosophy that builds on the legacy of Turing's computationalism. Info-computationalism is a synthesis of Informational Structural Realism (the view that nature is a web of informational structures) and Natural Computationalism (the view that nature physically computes its own time development). It presents a framework for the development of a unified approach to nature, with common interpretation of inanimate nature as well as living organisms and their social networks. Computing is understood as information processing that drives all the changes on different levels of organization of information and can be modeled as morphological computing on data sets pertinent to informational structures. The use of infocomputational conceptualizations, models and tools makes possible for the first time in history the study of complex selforganizing adaptive systems, including basic characteristics and functions of living systems, intelligence, and cognition.

Explore related subjects

cs.GL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gordana Dodig-Crnkovic. 2012-07-03. Alan Turing's Legacy: Info-Computational Philosophy of Nature. https://arxiv.org/abs/1207.1033

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligence

Dr. David Blackwell was a mathematician and statistician of the first rank, whose contributions to statistical theory, game theory, and decision theory predated many of the algorithmic breakthroughs that define modern artificial intelligence. This survey examines three of his most consequential theoretical results the Rao Blackwell theorem, the Blackwell Approachability theorem, and the Blackwell Informativeness theorem (comparison of experiments) and traces their direct influence on contemporary AI and machine learning. We show that these results, developed primarily in the 1940s and 1950s, remain technically live across modern subfields including Markov Chain Monte Carlo inference, autonomous mobile robot navigation (SLAM), generative model training, no-regret online learning, reinforcement learning from human feedback (RLHF), large language model alignment, and information design. NVIDIAs 2024 decision to name their flagship GPU architecture (Blackwell) provides vivid testament to his enduring relevance. We also document an emerging frontier: explicit Rao Blackwellized variance reduction in LLM RLHF pipelines, recently proposed but not yet standard practice. Together, Blackwell theorems form a unified framework addressing information compression, sequential decision making under uncertainty, and the comparison of information sources precisely the problems at the core of modern AI.

cs.GL↗
arXiv2026

The Reconstructions of Konrad Zuse's Z3 Computer

This paper reviews the various reconstructions of Konrad Zuse's Z3 computer, built in 1941. The first is the reconstruction made by Zuse himself in the 1960s, which is now housed at the Deutsches Museum in Munich. Second is the 2001 reconstruction, made in Berlin, and which has a didactic purpose. Third is the Z3r, a Z3 reconstruction built by Horst Zuse in honor of his father's 100th birthday. Fourth is the reconstruction by Christoph Traber in Switzerland. All of these machines strive to preserve the cultural heritage that the Z3 represents.

cs.GL↗
arXiv2026

Symbolic Mathematical Computation 1965--1975: The emergence of a discipline

Today, symbolic mathematical computation is taken for granted as part of the scientific infrastructure, but it has not always been so. This paper provides a historical survey of the discipline's formative decade, 1965-1975, viewed from a 50 year perspective. This span of years saw the evolution from a few specialized programs with naive algorithms to integrated systems with substantial capabilities. We highlight some of the important early figures in the field and the innovations upon which the current generation of systems and algorithms are built. By revisiting a period unfamiliar to most current readers, this survey aims to shed light on once-pressing issues that are now largely resolved and to highlight how some of today's challenges were recognized earlier than expected.

cs.GL↗