Reversible Computation

13th International Conference, RC 2021, Virtual Event, July 7–8, 2021, Proceedings

AvShigeru Yamashita,Tetsuo Yokoyama

Häftad, Engelska, 2021

Del 12805 i serien Lecture Notes in Computer Science

565 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 13th International Conference on Reversible Computation, RC 2021, which was held online during July 7-8, 2021.The 11 papers included in this book were carefully reviewed and selected from 21 submissions. The book also contains 2 invited talks in full-paper length, 3 work-in-progress papers and 1 tool paper. They were organized in topical sections named: programming and programming languages; reversible concurrent computation; theory and foundations; and circuit synthesis.

Produktinformation

Utgivningsdatum:2021-06-23
Mått:155 x 235 x 16 mm
Vikt:441 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:275
Förlag:Springer Nature Switzerland AG
ISBN:9783030798369

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

Invited Talks.- How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton.- Variational Quantum Eigensolver and Its Applications.- Programming and Programming Languages.- Reversible Functional Array Programming.- Compiling Janus to RSSA.- Causal-Consistent Debugging of Distributed Erlang Programs.- Towards a Unified Language Architecture for Reversible Object-Oriented Programming.- Reversible Concurrent Computation.- Towards a truly concurrent semantics for reversible CCS.- Forward-Reverse Observational Equivalences in CCSK.- Explicit Identifiers and Contexts in Reversible Concurrent Calculus.- Reversibility and predictions.- Theory and Foundations.- A Tangled Web of 12 Lens Laws.- Splitting recursion schemes into reversible and classical interacting threads.- Reversibility of Executable Interval Temporal Logic Specifications.- Circuit Synthesis.- Efficient Construction of Functional Representations for QuantumAlgorithms.- Finding Optimal Implementations of Non-native CNOT Gates using SAT.- Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network.- OR-Toffoli and OR-Peres Reversible Gates.