Computational complexity in non-Turing models of computation: The what, the why and the how
<p>We preliminarily recap what is meant by <em>complexity</em> and <em>non-Turing computation</em>, by way of explanation of our title, 'Computational Complexity in Non-Turing Models of Computation'.</p><p> Based on investigation of a motivating ex...
Main Author: | Blakey, E |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2011
|
Subjects: |
Similar Items
-
Unconventional complexity measures for unconventional computers
by: Blakey, E
Published: (2011) -
Dominance: consistently comparing computational complexity
by: Blakey, E
Published: (2008) -
A model-independent theory of computational complexity: from patience to precision and beyond
by: Blakey, E
Published: (2010) -
Apples and oranges? Comparing unconventional computers
by: Blakey, E
Published: (2010) -
Apples & oranges? Comparing unconventional computers
by: Blakey, E
Published: (2010)