Unconventional Universal Computation in Babbage's Analytical Engine

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Rojas, Raul
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866929451144577024
author Rojas, Raul
author_facet Rojas, Raul
contents This paper shows that the programming model of Babbage's Analytical Engine, although unconventional, can be harnessed in order to simulate indirect addressing, a capability that was not included in the original instruction set. That is, in a theoretical sense, the Analytical Engine was as universal as computers we have today. We show how to implement indirect addressing for a working memory of fixed size; this makes it possible to simulate a Turing machine with a finite tape. The result is, of course, only of theoretical and historical interest, without any practical implications.
format Preprint
id arxiv_https___arxiv_org_abs_2408_03334
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Unconventional Universal Computation in Babbage's Analytical Engine
Rojas, Raul
Logic in Computer Science
Hardware Architecture
68U01
K.2; B.1
This paper shows that the programming model of Babbage's Analytical Engine, although unconventional, can be harnessed in order to simulate indirect addressing, a capability that was not included in the original instruction set. That is, in a theoretical sense, the Analytical Engine was as universal as computers we have today. We show how to implement indirect addressing for a working memory of fixed size; this makes it possible to simulate a Turing machine with a finite tape. The result is, of course, only of theoretical and historical interest, without any practical implications.
title Unconventional Universal Computation in Babbage's Analytical Engine
topic Logic in Computer Science
Hardware Architecture
68U01
K.2; B.1
url https://arxiv.org/abs/2408.03334