Abstract
The computable functions on numbers can also be defined by WHILE-programs. Here the idea of computing on registers is combined with the idea of inductive definition. While-programs allow constructing very transparent algorithms and support correctness proofs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Weihrauch, K. (1987). WHILE-Programs and WHILE-Computability. In: Computability. EATCS Monographs on Theoretical Computer Science, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69965-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-69965-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69967-2
Online ISBN: 978-3-642-69965-8
eBook Packages: Springer Book Archive