A tutorial presented at the Mathematical Foundations of Programming Semantics XXIII Tutorial Day.
Continue reading Synthetic Computability (MFPS XXIII Tutorial)
|
|||||
|
At the EST training workshop in Fischbachau, Germany, I gave two lectures on syntehtic computability theory. This version of the talk contains material on recursive analysis which is not found in the MFPS XXI version of a similar talk. Abstract: Abstract: Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair amount of Gödel encodings which sometime obscure ingenious arguments. Consequently, there have been a number of presentations of computability theory that aimed to present the subject in an abstract and conceptually pleasing [...] |
|||||
|
|
|||||