product iamge

Recursion theory, its generalisations and applications: Proceedings Leeds, 1979

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): F. R. Drake, S. S. Wainer
Series: London Mathematical Society Lecture Note Series 45
Publisher: CUP
Year: 1980

Language: English
Pages: 327

Title ......Page 3
Copyright ......Page 4
Contents ......Page 5
Preface ......Page 7
List of Participants ......Page 8
Fundamental Methods for Constructing Recursively Enumerable Degrees ......Page 9
A Survey of Non-RE Degrees < 0' ......Page 60
Degrees of Generic Sets ......Page 118
The Degrees of Unsolvability: Some Recent Results ......Page 148
Some Constructions in a-Recursion Theory ......Page 166
The Recursion Theory of the Continuous Functionals ......Page 179
Three Aspects of Recursive Enumerability in Higher Types ......Page 192
Computing in Algebraic Systems ......Page 223
Applications of Classical Recursion Theory to Computer Science ......Page 244
"Natural" Programming Languages and Complexity Measures for Subrecursive Programming Languages: An Abstract Approach ......Page 256
Complexity Theory with Emphasis on the Complexity of Logical Theories ......Page 294