The following information was submitted:
Transactions: INTERNATIONAL JOURNAL of COMPUTERS
Transactions ID Number: 19-423
Full Name: Ed Blakey
Position: Ph.D. Candidate
Age: ON
Sex: Male
Address: Oxford University Computing Laboratory, Wolfson Building, Parks Road, OXFORD, OX1 3QD
Country: UNITED KINGDOM
Tel:
Tel prefix:
Fax:
E-mail address: ed.blakey@queens.oxon.org
Other E-mails:
Title of the Paper: Apples & oranges? Comparing unconventional computers
Authors as they appear in the Paper: Ed Blakey
Email addresses of all the authors: ed.blakey@queens.oxon.org
Number of paper pages: 8
Abstract: 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: that is, they are Turing machines, random-access machines or similar. However, whereas meaningful comparison between these conventional computers is well understood and correctly practised, that of non-standard machines (such as quantum, chemical and optical computers) is rarely even attempted and, where it is, is often attempted under the typically false assumption that the conventional-computing approach to comparison is adequate in the unconventional-computing case. We discuss in the present paper a computational-model-independent approach to the comparison of computers' complexity (and define the corresponding complexity classes). Notably, the approach allows meaning!
ful comparison between an unconventional computer and an existing, digital-computer benchmark that solves the same problem.
Keywords: Computational complexity. Computational resource. Dominance. Theoretical computer science. Unconventional computation.
EXTENSION of the file: .pdf
Special (Invited) Session: Apples and Oranges? Comparing Unconventional Computers
Organizer of the Session: 647-188
How Did you learn about congress:
IP ADDRESS: 86.30.179.228
