Описание: 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.
Автор: 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.
Автор: Klaus Weihrauch Название: Computability ISBN: 3642699677 ISBN-13(EAN): 9783642699672 Издательство: Springer Рейтинг: Цена: 11173.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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.
Автор: Adam Day; Michael Fellows; Noam Greenberg; Bakhady Название: Computability and Complexity ISBN: 3319500619 ISBN-13(EAN): 9783319500614 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The volume contains 42 papers presenting original unpublished research, or expository and survey results in Turing degrees, computably enumerable sets, computable algebra, computable model theory, algorithmic randomness, reverse mathematics, and parameterized complexity, all areas in which Rod Downey has had significant interests and influence.
Автор: John Longley; Dag Normann Название: Higher-Order Computability ISBN: 3662517116 ISBN-13(EAN): 9783662517116 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: John Longley; Dag Normann Название: Higher-Order Computability ISBN: 3662479915 ISBN-13(EAN): 9783662479919 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Arnold Beckmann; Victor Mitrana; Mariya Soskova Название: Evolving Computability ISBN: 3319200275 ISBN-13(EAN): 9783319200279 Издательство: Springer Рейтинг: Цена: 8944.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 11th Conference on Computability in Europe, CiE 2015, held in Bucharest, Romania, in June/July 2015. The 26 revised papers presented were carefully reviewed and selected from 64 submissions and included together with 10 invited papers in this proceedings.
Автор: Kozen, Dexter Название: Automata and computability ISBN: 1461273099 ISBN-13(EAN): 9781461273097 Издательство: Springer Рейтинг: Цена: 9083.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging.
Автор: Soare Название: Turing Computability ISBN: 3642319327 ISBN-13(EAN): 9783642319327 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Turing`s famous 1936 paper introduced a formal definition of a computing machine, a Turing machine. This book presents classical computability theory from Turing and Post to current results and methods, and their use in studying the information content of algebraic structures, models, and their relation to Peano arithmetic.
Автор: Pippenger Название: Theories of Computability ISBN: 0521553806 ISBN-13(EAN): 9780521553803 Издательство: Cambridge Academ Рейтинг: Цена: 14731.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only `the` theory of computability, but also a variety of other theories. Each topic is taken from the beginning and developed to a point at which the results can be appreciated.
Автор: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
