Computability Theory, Rebecca Weber

Автор: C.S. Calude; M.J. Dinneen; S. Sburlan
Название: Combinatorics, Computability and Logic
ISBN: 1852335262 ISBN-13(EAN): 9781852335267
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume contains the papers presented at the Third Combinatorics, Computability and Logic (DMTCS`01) conference, These papers cover topics such as abstract data types and specifications algorithms and data structures automata and formal languages computability among others.

Автор: Pour-El
Название: Computability in Analysis and Physics
ISBN: 1107168449 ISBN-13(EAN): 9781107168442
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The authors are concerned with the computability or noncomputability of standard processes in analysis and physics. The book is self-contained and serves well as an introduction to research in this area.

Автор: Soare
Название: Turing Computability
ISBN: 3642319327 ISBN-13(EAN): 9783642319327
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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
Рейтинг:
Цена: 98210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: George S. Boolos
Название: Computability and logic
ISBN: 0521701465 ISBN-13(EAN): 9780521701464
Издательство: Cambridge Academ
Рейтинг:
Цена: 33790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, but also a large number of optional topics, from Turing`s theory of computability to Ramsey`s theorem. This fifth edition was first published in 2007.

Автор: Eugenio G. Omodeo; Alberto Policriti
Название: Martin Davis on Computability, Computational Logic, and Mathematical Foundations
ISBN: 3319418416 ISBN-13(EAN): 9783319418414
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability.

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

Автор: Ershov, I?U?rii? Leonidovich.
Название: Definability and computability /
ISBN: 0306110393 ISBN-13(EAN): 9780306110399
Издательство: Springer
Рейтинг:
Цена: 213360.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the G del incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.