Typologies of Computation and Computational Models

Mark Burgin; Gordana Dodig-Crnkovic

Home/Archive/arXiv

arXiv · 1312.2447

Typologies of Computation and Computational Models

Mark Burgin·Gordana Dodig-Crnkovic

View original source ↗Read source document ↗Export metadata ↓

Abstract

We need much better understanding of information processing and computation as its primary form. Future progress of new computational devices capable of dealing with problems of big data, internet of things, semantic web, cognitive robotics and neuroinformatics depends on the adequate models of computation. In this article we first present the current state of the art through systematization of existing models and mechanisms, and outline basic structural framework of computation. We argue that defining computation as information processing, and given that there is no information without (physical) representation, the dynamics of information on the fundamental level is physical/ intrinsic/ natural computation. As a special case, intrinsic computation is used for designed computation in computing machinery. Intrinsic natural computation occurs on variety of levels of physical processes, containing the levels of computation of living organisms (including highly intelligent animals) as well as designed computational devices. The present article offers a typology of current models of computation and indicates future paths for the advancement of the field; both by the development of new computational models and by learning from nature how to better compute using different mechanisms of intrinsic computation.

Explore related subjects

cs.GL

Keep this discovery

BibTeX RIS

Mark Burgin, Gordana Dodig-Crnkovic. 2013-12-09. Typologies of Computation and Computational Models. https://arxiv.org/abs/1312.2447

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

KEEP EXPLORING

Related papers

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

A Brief History of Fr\'echet Distances: From Curves and Probability Laws to FID

This note provides a chronological account of Fr\'echet distances, starting with Maurice Fr\'echet's 1906 doctoral thesis on distances in abstract sets and tracing the Fr\'echet distance between polygonal curves and its algorithmic computation in the 1990s. It then continues with his 1957 paper on a coupling-based distance between probability laws with a brief glimpse of Wasserstein distance and optimal transport. We further attempt to draw connections between the distributional, coupling-based facet of Fr\'echet distances on probability laws and the geometric facet on curves. The note ends with a modern use case, the Fr\'echet Inception Distance (FID) in the era of deep generative model evaluation, interpretable as the Wasserstein-2 distance between multivariate Gaussians in a learned feature space. An appendix includes \TeX{}ified faithful English translations of Fr\'echet's 1906 thesis and 1957 paper, and L\'evy's 1950 note for reader convenience.

cs.GL↗

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↗