References
Facsimile [PDF, 7.0M]

An Introduction to the Computation Model of Blum, Shub and Smale

Corine Ceola

p. 234-248

    Abstract

    In this paper, we present an introduction to the theory of computability and complexity over a ring proposed by L. Blum, M. Shub and S. Smale in [Blum-Shub-Smale-1989].

    Index

    Keywords

    computability, recursion theory, decidability, acceptability, complexity

    Text

    Download Facsimile [PDF, 7.0M]

    References

    Bibliographical reference

    Corine Ceola, « An Introduction to the Computation Model of Blum, Shub and Smale », CASYS, 1 | 1998, 234-248.

    Electronic reference

    Corine Ceola, « An Introduction to the Computation Model of Blum, Shub and Smale », CASYS [Online], 1 | 1998, Online since 05 July 2024, connection on 19 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=1140

    Author

    Corine Ceola

    Institute of Mathematic, University of Liège (B37) – Grande Traverse, 12 – Sart Tilman B-4000 Liège (Belgium)

    Copyright

    CC BY-SA 4.0 Deed