Sequential real number computation and recursive relations
DOI10.1002/MALQ.200710065zbMATH Open1328.03046OpenAlexW2063509913MaRDI QIDQ3528145FDOQ3528145
Authors: J. Raymundo Marcial-Romero, M. Andrew Moshier 
Publication date: 8 October 2008
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200710065
Recommendations
Computation over the reals, computable analysis (03D78) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- LCF considered as a programming language
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the non-sequential nature of the interval-domain model of real-number computation
- Notions of computation and monads
- Semantics of a sequential language for exact real-number computation
- Recursive characterization of computable real-valued functions and relations
- Title not available (Why is that?)
- Sequentiality and piecewise-affinity in segments of Real-PCF
- Sequential real number computation and recursive relations
Cited In (4)
Uses Software
This page was built for publication: Sequential real number computation and recursive relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528145)
