Author: Jens E. Fenstad
Publisher: Cambridge University Press
ISBN: 1107168163
Category : Mathematics
Languages : en
Pages : 238
Book Description
This volume presents a unified and coherent account of the many and various parts of general recursion theory.
General Recursion Theory
Author: Jens E. Fenstad
Publisher: Cambridge University Press
ISBN: 1107168163
Category : Mathematics
Languages : en
Pages : 238
Book Description
This volume presents a unified and coherent account of the many and various parts of general recursion theory.
Publisher: Cambridge University Press
ISBN: 1107168163
Category : Mathematics
Languages : en
Pages : 238
Book Description
This volume presents a unified and coherent account of the many and various parts of general recursion theory.
Generalized Recursion Theory
Author: Lev D. Beklemishev
Publisher: Elsevier
ISBN: 0080954898
Category : Computers
Languages : en
Pages : 465
Book Description
Generalized Recursion Theory
Publisher: Elsevier
ISBN: 0080954898
Category : Computers
Languages : en
Pages : 465
Book Description
Generalized Recursion Theory
General Recursion Theory
Author: Jens E. Fenstad
Publisher: Cambridge University Press
ISBN: 1316739368
Category : Mathematics
Languages : en
Pages : 239
Book Description
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.
Publisher: Cambridge University Press
ISBN: 1316739368
Category : Mathematics
Languages : en
Pages : 239
Book Description
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.
General Recursion Theory
Author: Jens E. Fenstad
Publisher:
ISBN: 9781316749012
Category : Recursion theory
Languages : en
Pages : 239
Book Description
This volume presents a unified and coherent account of the many and various parts of general recursion theory.
Publisher:
ISBN: 9781316749012
Category : Recursion theory
Languages : en
Pages : 239
Book Description
This volume presents a unified and coherent account of the many and various parts of general recursion theory.
Classical recursion theory : the theory of functions and sets of natural numbers
Author: Piergiorgio Odifreddi
Publisher:
ISBN: 9780444589439
Category : Recursion theory
Languages : en
Pages : 668
Book Description
Publisher:
ISBN: 9780444589439
Category : Recursion theory
Languages : en
Pages : 668
Book Description
Recursion Theory
Author: Chi Tat Chong
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 311038129X
Category : Mathematics
Languages : en
Pages : 409
Book Description
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 311038129X
Category : Mathematics
Languages : en
Pages : 409
Book Description
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Higher Recursion Theory
Author: Gerald E. Sacks
Publisher: Cambridge University Press
ISBN: 1107168430
Category : Computers
Languages : en
Pages : 361
Book Description
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Publisher: Cambridge University Press
ISBN: 1107168430
Category : Computers
Languages : en
Pages : 361
Book Description
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Computability
Author: Nigel Cutland
Publisher: Cambridge University Press
ISBN: 9780521294652
Category : Computers
Languages : en
Pages : 268
Book Description
What can computers do in principle? What are their inherent theoretical limitations? The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function - a function whose values can be calculated in an automatic way.
Publisher: Cambridge University Press
ISBN: 9780521294652
Category : Computers
Languages : en
Pages : 268
Book Description
What can computers do in principle? What are their inherent theoretical limitations? The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function - a function whose values can be calculated in an automatic way.
Classical Recursion Theory
Author: P. Odifreddi
Publisher: Elsevier
ISBN: 9780080886596
Category : Computers
Languages : en
Pages : 667
Book Description
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Publisher: Elsevier
ISBN: 9780080886596
Category : Computers
Languages : en
Pages : 667
Book Description
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Generalized Recursion Theory
Author: Jens Erik Fenstad
Publisher:
ISBN: 9780720422009
Category : Recursive functions
Languages : en
Pages : 456
Book Description
Publisher:
ISBN: 9780720422009
Category : Recursive functions
Languages : en
Pages : 456
Book Description