Abstract State Machines with Exact Real Arithmetic

DOI10.1007/978-3-319-91271-4_10OpenAlexW2801666084MaRDI QIDQ5881448

Christoph Beierle, Klaus-Dieter Schewe

Publication date: 10 March 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-91271-4_10

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Classical models of computation (Turing machines, etc.) (68Q04)

Uses Software

• CoreASM
• xrc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementing exact real arithmetic in python, C++ and C
• Choiceless polynomial time
• Refinement of rational end-points real numbers by means of floating-point numbers
• Using PVS to validate the algorithms of an exact arithmetic.
• Semantics of a sequential language for exact real-number computation
• Computable Jordan Decomposition of Linear Continuous Functionals on $C[0;1$]
• Computability of the Radon-Nikodym Derivative
• Abstract State Machines

This page was built for publication: Abstract State Machines with Exact Real Arithmetic