A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The main aim of this article is to examine proposed theses for computation and recursion on concrete and abstract structures. What is generally referred to as Church's Thesis or the Church-Turing Thesis (abbreviated CT here) must be restricted to concrete structures whose objects are finite symbolic configurations of one sort or another. Informal and principled arguments for CT on concrete structures are reviewed. Next, it is argued that proposed generalizations of notions of computation todoi:10.1007/978-3-319-22156-4_4 fatcat:enmthkhf65gefgall34djoykxy