A Behavioural Foundation for Natural Computing and a Programmability Test
Abstract
What does it mean to claim that a physical or natural system computes? One answer, endorsed here, is that computing is about programming a system to behave in different ways. This paper offers an account of what it means for a physical system to compute based on this notion. It proposes a behavioural characterisation of computing in terms of a measure of programmability, which reflects a system's ability to react to external stimuli. The proposed measure of programmability is useful for classifying computers in terms of the apparent algorithmic complexity of their evolution in time. I make some specific proposals in this connection and discuss this approach in the context of other behavioural approaches, notably Turing's test of machine intelligence. I also anticipate possible objections and consider the applicability of these proposals to the task of relating abstract computation to nature-like computation.
Cite
@article{arxiv.1303.5887,
title = {A Behavioural Foundation for Natural Computing and a Programmability Test},
author = {Hector Zenil},
journal= {arXiv preprint arXiv:1303.5887},
year = {2013}
}
Comments
37 pages, 4 figures. Based on an invited Talk at the Symposium on Natural/Unconventional Computing and its Philosophical Significance, Alan Turing World Congress 2012, Birmingham, UK. http://link.springer.com/article/10.1007/s13347-012-0095-2 Ref. glitch fixed in 2nd. version; Philosophy & Technology (special issue on History and Philosophy of Computing), Springer, 2013