Reversibility and adiabatic computation: trading time and space for energy

DOI10.1098/rspa.1996.0039zbMath0869.68019arXivquant-ph/9703022OpenAlexW3104365962MaRDI QIDQ3126112

Paul M. B. Vitányi, Ming Li

Publication date: 23 March 1997

Published in: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/9703022

zbMATH Keywords

logical reversibility of computation

Mathematics Subject Classification ID

Computer system organization (68M99) General theory of computer systems (68M01)

Related Items (11)

Algorithmic arguments in physics of computation ⋮ Time and space complexity of reversible pebbling ⋮ Energy complexity of computation ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Energy complexity of regular languages ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Real-Time Methods in Reversible Computation ⋮ Reversible space equals deterministic space ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling

This page was built for publication: Reversibility and adiabatic computation: trading time and space for energy