Verwandte Artikel zu Abstract Recursion and Intrinsic Complexity: 48 (Lecture...
Abstract Recursion and Intrinsic Complexity: 48 (Lecture Notes in Logic, Series Number 48) - Hardcover
Inhaltsangabe
The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
Biografía del autor
Yiannis N. Moschovakis is Professor Emeritus and Distinguished Research Professor of Mathematics at the University of California, Los Angeles, and Professor Emeritus at the University of Athens. Among his many professional commendations he is a Fellow of the AMS and a corresponding member of the Academy of Athens. He has received Guggenheim and Sloan Fellowships and has been an invited speaker at the International Congress of Mathematicians. Professor Moschovakis has worked primarily in the theory of recursion, descriptive set theory and the foundations of the theory of algorithms and computation.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagCambridge University Press
- Erscheinungsdatum2018
- ISBN 10 110841558X
- ISBN 13 9781108415583
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten250
Gebraucht kaufen
Zustand: BefriedigendCover and edges may have some wear...
Diesen Artikel anzeigen
EUR 65,69
EUR 3,53 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 154,81
Gratis für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerSuchergebnisse für Abstract Recursion and Intrinsic Complexity: 48 (Lecture...
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic, Series Number 48)
Verlag:
Cambridge University Press, 2019
ISBN 10: 110841558X
ISBN 13: 9781108415583
Gebraucht
Hardcover
Anbieter: Books From California, Simi Valley, CA, USA
Verkäuferbewertung 4 von 5 Sternen
hardcover. Zustand: Good. Cover and edges may have some wear. Mild to Moderate creasing / bending to covers and pages. Bestandsnummer des Verkäufers mon0003603988
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers FM-9781108415583
Anzahl: 7 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
Neu
Hardcover
Anbieter: Grand Eagle Retail, Fairfield, OH, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: new. Hardcover. This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Bestandsnummer des Verkäufers 9781108415583
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers FM-9781108415583
Anzahl: 7 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock. Bestandsnummer des Verkäufers __110841558X
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardback. Zustand: New. New copy - Usually dispatched within 4 working days. 518. Bestandsnummer des Verkäufers B9781108415583
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity (Hardcover)
Verlag:
Cambridge University Press, Cambridge, 2018
ISBN 10: 110841558X
ISBN 13: 9781108415583
Neu
Hardcover
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: new. Hardcover. This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Bestandsnummer des Verkäufers 9781108415583
Anzahl: 1 verfügbar
Foto des Verkäufers
Abstract Recursion and Intrinsic Complexity
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes . Bestandsnummer des Verkäufers 251536931
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Abstract Recursion and Intrinsic Complexity
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock. Bestandsnummer des Verkäufers x-110841558X
Anzahl: 1 verfügbar
Foto des Verkäufers
Abstract Recursion and Intrinsic Complexity
Verlag:
Cambridge University Press Feb 2019, 2019
ISBN 10: 110841558X
ISBN 13: 9781108415583
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Neuware - Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation. Bestandsnummer des Verkäufers 9781108415583
Anzahl: 1 verfügbar