Unconventional complexity measures for unconventional computers
From MaRDI portal
Publication:1761690
DOI10.1007/s11047-010-9226-9zbMath1251.68121OpenAlexW2034074360MaRDI QIDQ1761690
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:b6d4ca5f-6f40-4445-b046-3c0ce45de9c7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Complexity-style resources in cryptography ⋮ Physical Computational Complexity and First-order Logic ⋮ Anti-heterotic Computing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factorizing RSA keys, an improved analogue solution
- The complexity of analog computation
- The differential analyzer. A new machine for solving differential equations
- On the Complexity of Measurement in Classical Physics
- Irreversibility and Heat Generation in the Computing Process
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Algorithms and Computation
This page was built for publication: Unconventional complexity measures for unconventional computers
