Higher-Order Computability

Häftad, Engelska, 2016

Av John Longley, Dag Normann

2 299 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

2 299 kr

Skickas inom 10-15 vardagar

This book offers a self-contained exposition of the theory of computability in a higher-order context, where 'computable operations' may themselves be passed as arguments to other computable operations.

Produktinformation

Utgivningsdatum2016-08-23
Mått155 x 235 x 32 mm
Vikt879 g
FormatHäftad
SpråkEngelska
SerieTheory and Applications of Computability
Antal sidor571
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662517116

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it

Introduction and Motivation.- Historical Survey.- Theory of Computability Models.- Theory of Lambda Algebras.- Kleene Computability in a Total Setting.- Nested Sequential Procedures.- PCF and Its Models.- Total Continuous Functionals.- Hereditarily Effective Operations.- Partial Continuous Functionals.- Sequentially Realizable Functionals.- Some Intensional Models.- Related and Future Work.- References.- Index.

“This book is a true tour de force. The content is both mathematics and computer science; it is simultaneously an introductory textbook for students, a tutorial for seasoned researchers, a reference work, and a research monograph; ... The references to the literature are thorough. The writing is technical mathematics, and is good by that standard: there is ample intuitive explanation, and it is overall readable.” (Robert S. Lubarsky, Mathematical Reviews, April 2018)