Turner, Raymond
Computable Models
2. What is a Computable Model?
Raymond Turner
3. Typed Predicate Logic
Raymond Turner
4. Data Types
Raymond Turner
5. Definability
Raymond Turner
6. Specification
Raymond Turner
7. Functions
Raymond Turner
8. Preconditions
Raymond Turner
9. Natural Numbers
Raymond Turner
10. Typed Set Theory
Raymond Turner
11. Systems Modeling
Raymond Turner
12. A Type of Types
Raymond Turner
13. Schemata
Raymond Turner
14. Separation Types
Raymond Turner
15. Recursive Schemata
Raymond Turner
16. Inductive Types
Raymond Turner
17. Recursive Functions
Raymond Turner
18. Schema Definitions
Raymond Turner
19. Computable Ontology
Raymond Turner
20. Classes
Raymond Turner
21. Classes of Functions
Raymond Turner
22. Computable Analysis
Raymond Turner
23. Programming Language Specification
Raymond Turner
24. Abstract Types
Raymond Turner
25. Conclusion
Raymond Turner
Keywords: Computer Science, Language Translation and Linguistics, Artificial Intelligence (incl. Robotics), Mathematical Logic and Formal Languages, Logics and Meanings of Programs, Computation by Abstract Devices, Theory of Computation
- Author(s)
- Turner, Raymond
- Publisher
- Springer
- Publication year
- 2009
- Language
- en
- Edition
- 1
- Page amount
- 9 pages
- Category
- Information Technology, Telecommunications
- Format
- Ebook
- eISBN (PDF)
- 9781848820524