## Natural computation and non-Turing models of computation (2004)

### Cached

### Download Links

- [www.cs.utk.edu]
- [www.cs.utk.edu]
- [web.eecs.utk.edu]
- [web.eecs.utk.edu]
- [www.cs.queensu.ca]
- [research.cs.queensu.ca]
- [www.cs.utk.edu]
- [web.eecs.utk.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 18 - 9 self |

### BibTeX

@ARTICLE{Maclennan04naturalcomputation,

author = {Bruce J. Maclennan},

title = {Natural computation and non-Turing models of computation},

journal = {Theoretical Computer Science},

year = {2004},

volume = {317},

pages = {115--145}

}

### Years of Citing Articles

### OpenURL

### Abstract

We propose certain non-Turing models of computation, but our intent is not to advocate models that surpass the power of Turing Machines (TMs), but to defend the need for models with orthogonal notions of power. We review the nature of models and argue that they are relative to a domain of application and are ill-suited to use outside that domain. Hence we review the presuppositions and context of the TM model and show that it is unsuited to natural computation (computation occurring in or inspired by nature). Therefore we must consider an expanded definition of computation that includes alternative (especially analog) models as well as the TM. Finally we present an alternative model, of continuous computation, more suited to natural computation. We conclude with remarks on the expressivity of formal mathematics. Key words: analog computation, analog computer, biocomputation, computability, computation on reals, continuous computation, formal system, hypercomputation,