John Longley & Dag Normann: Higher-Order Computability - neues Buch
ISBN: 9783662479926
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 computa… Mehr…
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. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers eBooks > Fremdsprachige eBooks > Englische eBooks > Sach- & Fachthemen > Informatik; eBooks > Fachbücher > Informatik , Springer, PDF, Springer<
Orellfuessli.ch
Nr. A1039002750. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.30) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
John Longley#Dag Normann: Higher-Order Computability - neues Buch
2015, ISBN: 9783662479926
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 computa… Mehr…
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. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers eBook John Longley#Dag Normann 06.11.2015, Springer, Springer<
Orellfuessli.ch
Nr. 44837056. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 16.52) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
John Longley/ Dag Normann: Higher-Order Computability - neues Buch
ISBN: 3662479923
Higher-Order Computability ab 160.49 € als pdf eBook: . Aus dem Bereich: eBooks, Sachthemen & Ratgeber, Computer & Internet, Medien > Bücher, Higher-Order Computability - eBook als pdf vo… Mehr…
Higher-Order Computability ab 160.49 € als pdf eBook: . Aus dem Bereich: eBooks, Sachthemen & Ratgeber, Computer & Internet, Medien > Bücher, Higher-Order Computability - eBook als pdf von John Longley/ Dag Normann - Springer-Verlag GmbH - 9783662479926<
Hugendubel.de
Nr. 25275571. Versandkosten:, , DE. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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 computa… Mehr…
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. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers eBooks > Fremdsprachige eBooks > Englische eBooks > Sach- & Fachthemen > Informatik; eBooks > Fachbücher > Informatik , Springer, PDF, Springer<
Nr. A1039002750. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 17.30)
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 computa… Mehr…
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. The subject originated in the 1950s with the work of Kleene, Kreisel and others, and has since expanded in many different directions under the influence of workers from both mathematical logic and computer science. The ideas of higher-order computability have proved valuable both for elucidating the constructive content of logical systems, and for investigating the expressive power of various higher-order programming languages. In contrast to the well-known situation for first-order functions, it turns out that at higher types there are several different notions of computability competing for our attention, and each of these has given rise to its own strand of research. In this book, the authors offer an integrated treatment that draws together many of these strands within a unifying framework, revealing not only the range of possible computability concepts but the relationships between them. The book will serve as an ideal introduction to the field for beginning graduate students, as well as a reference for advanced researchers eBook John Longley#Dag Normann 06.11.2015, Springer, Springer<
Nr. 44837056. Versandkosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Sofort per Download lieferbar, zzgl. Versandkosten. (EUR 16.52)
John Longley/ Dag Normann: Higher-Order Computability - neues Buch
ISBN: 3662479923
Higher-Order Computability ab 160.49 € als pdf eBook: . Aus dem Bereich: eBooks, Sachthemen & Ratgeber, Computer & Internet, Medien > Bücher, Higher-Order Computability - eBook als pdf vo… Mehr…
Higher-Order Computability ab 160.49 € als pdf eBook: . Aus dem Bereich: eBooks, Sachthemen & Ratgeber, Computer & Internet, Medien > Bücher, Higher-Order Computability - eBook als pdf von John Longley/ Dag Normann - Springer-Verlag GmbH - 9783662479926<
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Detailangaben zum Buch - Higher-Order Computability
EAN (ISBN-13): 9783662479926 ISBN (ISBN-10): 3662479923 Erscheinungsjahr: 2015 Herausgeber: Springer Berlin
Buch in der Datenbank seit 2016-02-12T14:36:07+01:00 (Vienna) Detailseite zuletzt geändert am 2022-11-28T16:17:51+01:00 (Vienna) ISBN/EAN: 9783662479926
ISBN - alternative Schreibweisen: 3-662-47992-3, 978-3-662-47992-6 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: john norman, longley john, springer berlin heidelberg, norm longley, dag normann Titel des Buches: higher order computability
Daten vom Verlag:
Autor/in: John Longley; Dag Normann Titel: Theory and Applications of Computability; Higher-Order Computability Verlag: Springer; Springer Berlin 571 Seiten Erscheinungsjahr: 2015-11-06 Berlin; Heidelberg; DE Sprache: Englisch 160,49 € (DE) 165,00 € (AT) 189,00 CHF (CH) Available XVI, 571 p. 2 illus. in color.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Computability Models; Computability Theory; Intensional Models; Kleene Computability; Lambda Algebras; B; Theory of Computation; Mathematics of Computing; Computer Science; Mathematik für Informatiker; BB
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. Valuable for researchers in mathematical logic and theoretical computer science Consolidates work carried out in this domain since the 1950s Asks what ‘computability’ means for data more complex than natural numbers
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
