Sequential Real Number Computation and Recursive Relations
From MaRDI portal
Publication:4918036
DOI10.1016/j.entcs.2008.03.014zbMath1262.03087MaRDI QIDQ4918036
J. Raymundo Marcial-Romero, M. Andrew Moshier
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.014
recursive relations; semantics; PCF; non-determinism; sequential computation; exact real-number computation
68Q55: Semantics in the theory of computing
03D20: Recursive functions and relations, subrecursive hierarchies
03D78: Computation over the reals, computable analysis
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- LCF considered as a programming language
- Recursive characterization of computable real-valued functions and relations
- PCF extended with real numbers
- Semantics of a sequential language for exact real-number computation
- On the non-sequential nature of the interval-domain model of real-number computation