Reversibility in space-bounded computation
From MaRDI portal
Publication:2930716
DOI10.1080/03081079.2014.920998zbMATH Open1366.68060OpenAlexW2037015407MaRDI QIDQ2930716FDOQ2930716
Authors: Kenichi Morita 
Publication date: 19 November 2014
Published in: International Journal of General Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081079.2014.920998
Recommendations
- Reversible simulation of space-bounded computations
- Time/Space Trade-Offs for Reversible Computation
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Time and space bounds for reversible simulation
- A structural approach to reversible computation
- An axiomatic approach to reversible computation
- scientific article; zbMATH DE number 1754652
- Reversal complexity revisited
- scientific article; zbMATH DE number 1189113
- Reversible computation in term rewriting
reversibilitydeterminismspace complexityreversible computingspace-bounded Turing machinesymmetric Turing machine
Cites Work
Cited In (13)
- Reversibility of computations in graph-walking automata
- Reversible parallel computation: An evolving space-model
- Reverse complexity
- Verified compilation of space-efficient reversible circuits
- Quantitative Analysis of Concurrent Reversible Computations
- A structural approach to reversible computation
- Sublogarithmic Bounds on Space and Reversals
- Time complexity of tape reduction for reversible Turing machines
- A hierarchy of fast reversible Turing machines
- Reversible space equals deterministic space
- GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
- Reversible simulation of space-bounded computations
- Time and space complexity of reversible pebbling
This page was built for publication: Reversibility in space-bounded computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930716)
