Journal article icon

Journal article

Unconventional complexity measures for unconventional computers

Abstract:

Unconventional computers—which may, for example, exploit chemical/analogue/quantum phenomena in order to compute, rather than electronically implementing discrete logic gates—are widely studied in both theoretical and practical contexts. One particular motivation behind unconventional computation is the desire efficiently to solve classically difficult problems—we recall chemical-computer attempts at solving NP-complete problems such as the Travelling Salesperson Problem—, with computational ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Author's Original

Actions


Access Document


Files:
Publisher copy:
10.1007/s11047-010-9226-9

Authors


More by this author
Institution:
University of Oxford
Oxford college:
Queen's College, The
Department:
Mathematical, Physical & Life Sciences Division - Computing Laboratory
Publisher:
Springer Publisher's website
Journal:
Natural Computing Journal website
Volume:
10
Issue:
4
Pages:
1245-1259
Publication date:
2011-12-05
DOI:
EISSN:
1572-9796
ISSN:
1567-7818
URN:
uuid:b6d4ca5f-6f40-4445-b046-3c0ce45de9c7
Local pid:
ora:7818

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP