Adobe PDF
(305.68 kB)
| Title Details: | |
|
Computability, recursive functions |
|
| Authors: |
Koletsos, Georgios |
| Reviewer: |
Dimitrakopoulos, Konstantinos |
| Subject: | HUMANITIES AND ARTS > LOGIC AND PHILOSOPHY OF LOGIC HUMANITIES AND ARTS > LOGIC AND PHILOSOPHY OF LOGIC > LOGIC AND PHILOSOPHY OF LOGIC, MISCELLANEOUS > DEDUCTIVE LOGIC MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > MATHEMATICAL LOGIC AND FOUNDATIONS MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE |
| Description: | |
| Abstract: |
The Concept of a Computable Function. Models of computation. Turing machines and Turing-computable functions. Recursive functions. Primitive recursive functions. Kleene's minimization operator and general total and partial recursive functions. Schemes for the generation and manipulation of recursive functions. Gödel's β-function and sequence numbers. Encoding and corresponding functions. Proof that primitive recursion is defined based on the schemes of general recursion. Equivalence of recursive functions and Turing-computable functions. Analysis of the concept of computability and Church's thesis.
|
| Linguistic Editors: |
Toulatou, Dimitra |
| Technical Editors: |
Stavrinos, Giorgos |
| Type: |
Chapter |
| Creation Date: | 2015 |
| Item Details: | |
| License: |
http://creativecommons.org/licenses/by-nc-nd/3.0/gr |
| Handle | http://hdl.handle.net/11419/2303 |
| Bibliographic Reference: | Koletsos, G. (2015). Computability, recursive functions [Chapter]. In Koletsos, G. 2015. Mathematical Logic [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/2303 |
| Language: |
Greek |
| Is Part of: |
Mathematical Logic |
| Publication Origin: |
Kallipos, Open Academic Editions |