Apples & oranges? Comparing unconventional computers
Complexity theorists routinely compare—via the pre-ordering induced by asymptotic notation—the efficiency of computers so as to ascertain which offers the most efficient solution to a given problem. Tacit in this statement, however, is that the computers conform to a standard computational model: th...
Main Author: | Blakey, E |
---|---|
Format: | Journal article |
Language: | English |
Published: |
North Atlantic University Union (NAUN)
2010
|
Subjects: |
Similar Items
-
Apples and oranges? Comparing unconventional computers
by: Blakey, E
Published: (2010) -
Unconventional complexity measures for unconventional computers
by: Blakey, E
Published: (2011) -
Dominance: consistently comparing computational complexity
by: Blakey, E
Published: (2008) -
Computational complexity in non-Turing models of computation: The what, the why and the how
by: Blakey, E
Published: (2011) -
A model-independent theory of computational complexity: from patience to precision and beyond
by: Blakey, E
Published: (2010)