Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: AwesomeBooks, Wallingford, Reino Unido
hardcover. Condición: Very Good. Abstract Recursion and Intrinsic Complexity: Series Number 48 (Lecture Notes in Logic, Series Number 48) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. Nº de ref. del artículo: 7719-9781108415583
Cantidad disponible: 2 disponibles
Librería: Bahamut Media, Reading, Reino Unido
hardcover. Condición: Very Good. This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. Nº de ref. del artículo: 6545-9781108415583
Cantidad disponible: 1 disponibles
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
hardcover. Condición: Good. Cover and edges may have some wear. Mild to Moderate creasing / bending to covers and pages. Nº de ref. del artículo: mon0003603988
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock. Nº de ref. del artículo: __110841558X
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. New copy - Usually dispatched within 4 working days. 518. Nº de ref. del artículo: B9781108415583
Cantidad disponible: Más de 20 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: 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. Nº de ref. del artículo: 9781108415583
Cantidad disponible: 1 disponibles
Librería: moluna, Greven, Alemania
Condición: 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 . Nº de ref. del artículo: 251536931
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 243 pages. 9.25x6.25x0.75 inches. In Stock. Nº de ref. del artículo: x-110841558X
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: Neu. Neuware - Presents a new framework for the complexity of algorithms, for all readers interested in the theory of computation. Nº de ref. del artículo: 9781108415583
Cantidad disponible: 1 disponibles