- Abadi, M. and Cardelli, L. A Theory of Objects. monographs in Computer Science, 1996. Google ScholarDigital Library
- Biraben, Rodolfo Ertola. Tese de Church (Churchs Thesis). Coleo CLE, Unicamp, 1996.Google Scholar
- Milner, R. Communicating and Concurrency. Prentice-Hall, 1989. Google ScholarDigital Library
- Odifreddi, Piergiorgio. Classical Recursion Theory --- The Theory of Functions and Sets of Natural Numbers. Elsevier Sience Publishers B. V., 1989.Google Scholar
- Turing, Alan. On Computable Numbers, With an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42 (2), 1936.Google Scholar
Index Terms
- Review of models of computation: an introduction to computability theory, by Maribel Fernández
Recommendations
Models of parallel computation: a survey and synthesis
HICSS '95: Proceedings of the 28th Hawaii International Conference on System SciencesIn the realm of sequential computing, the random access machine has successfully provided an underlying model of computation that has promoted consistency and coordination among algorithm developers, computer architects and language experts. In the ...
A topological view on algebraic computation models
We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The framework ...
Comments