What is a universal computing machine?

Delvenne, Jean-Charles
(2009) Applied Mathematics and Computation — Vol. 215, n° 4, p. 1368-1374 (2009)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 231 KB
Request a copy

Details

Authors
Abstract
A computer is classically formalised as a universal Turing machine or a similar device. However over the years a lot of research has focused on the computational properties of dynamical systems other than Turing machines, such cellular automata, artificial neural networks, mirrors systems, etc. In this paper we propose a unifying formalism derived from a generalisation of Turing's arguments. Then we review some of universal systems proposed in the literature and show that are particular case of this formalism. Finally, we review some of the attempts to understand the relation between dynamical and computational properties of a system. (C) 2009 Elsevier Inc. All rights reserved.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Delvenne, J.-C. (2009). What is a universal computing machine? Applied Mathematics and Computation, 215(4), 1368-1374. https://doi.org/10.1016/j.amc.2009.04.057 (Original work published 2009)