Computability and Complexity, Adam Day; Michael Fellows; Noam Greenberg; Bakhady

Автор: Gilles Dowek
Название: Proofs and Algorithms: Introduction to Logic and Computability Theory
ISBN: 0857291203 ISBN-13(EAN): 9780857291202
Издательство: Springer
Рейтинг:
Цена: 4884.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

Автор: Rogers, H.
Название: Theory of recursive functions and effective computability /
ISBN: 0262680521 ISBN-13(EAN): 9780262680523
Издательство: MIT Press
Рейтинг:
Цена: 8465.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: (Reprint of the 1967 edition)

Автор: Steven Homer; Alan L. Selman
Название: Computability and Complexity Theory
ISBN: 1489989714 ISBN-13(EAN): 9781489989710
Издательство: Springer
Рейтинг:
Цена: 9781.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.

Автор: Jens Blanck; Vasco Brattka; Peter Hertling
Название: Computability and Complexity in Analysis
ISBN: 3540421971 ISBN-13(EAN): 9783540421979
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Computability and Complexity in Analysis, CCA 2000, held in Swansea, UK, in September 2000. The book presents a cross-section on contemporary research on computability and complexity in analysis.

Автор: Cooper, S. Barry
Название: Computability theory
ISBN: 1584882379 ISBN-13(EAN): 9781584882374
Издательство: Taylor&Francis
Рейтинг:
Цена: 15312.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Offers an introduction to contemporary computability theory, techniques, and results. This book places the basic concepts and techniques of computability theory in their historical, philosophical and logical context. It includes a chapter that explores a variety of computability applications to mathematics and science.