Algebraic Computability and Enumeration Models, Nourani

Автор: Barry S. Cooper; Sergei S. Goncharov
Название: Computability and Models
ISBN: 1461352258 ISBN-13(EAN): 9781461352259
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world.

Автор: Rebecca Weber
Название: Computability Theory
ISBN: 082187392X ISBN-13(EAN): 9780821873922
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 36960.00 T
Наличие на складе: Невозможна поставка.
Описание: What can we compute--even with unlimited resources? Is everything within reach? Or are computations necessarily drastically limited, not just in practice, but theoretically? These questions are at the heart of computability theory. The goal of this book is to give the reader a firm grounding in the fundamentals of computability theory and an overview of currently active areas of research, such as reverse mathematics and algorithmic randomness. Turing machines and partial recursive functions are explored in detail, and vital tools and concepts including coding, uniformity, and diagonalization are described explicitly. From there the material continues with universal machines, the halting problem, parametrization and the recursion theorem, and thence to computability for sets, enumerability, and Turing reduction and degrees. A few more advanced topics round out the book before the chapter on areas of research. The text is designed to be self-contained, with an entire chapter of preliminary material including relations, recursion, induction, and logical and set notation and operators. That background, along with ample explanation, examples, exercises, and suggestions for further reading, make this book ideal for independent study or courses with few prerequisites.

Автор: 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.

Автор: 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.

Автор: 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)

Автор: Mark Braverman; Michael Yampolsky
Название: Computability of Julia Sets
ISBN: 3642088066 ISBN-13(EAN): 9783642088063
Издательство: Springer
Рейтинг:
Цена: 88500.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Among all computer-generated mathematical images, Julia sets of rational maps occupy one of the most prominent positions. This accessible book summarizes the present knowledge about the computational properties of Julia sets in a self-contained way.

Автор: Sernadas Amilcar, Sernadas Cristina, Rasga Joao
Название: A Mathematical Primer on Computability
ISBN: 1848902964 ISBN-13(EAN): 9781848902961
Издательство: Неизвестно
Цена: 26360.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

The book provides a self-contained introduction to computability theory for advanced undergraduate or early graduate students of mathematics and computer science. The technical material is illustrated with plenty of examples, problems with fully worked solutions as well as a range of proposed exercises.

Part I is centered around fundamental computability notions and results, starting with the pillar concepts of computational model (an abstract high-level programming language), computable function, decidable and listable set, proper universal function, decision problem and the reduction technique for transferring decidability and listability properties. The essential results namely Rice's Theorem, Rice-Shapiro's Theorem, Rice-Shapiro-McNaughton-Myhill's Theorem as well as Rogers' Theorem and the Recursion Theorem are presented and illustrated. Many-to-one reducibility and many-to-one degrees are investigated. A short introduction to computation with oracles is also included. Computable as well as non-computable operators are introduced as well as monotonic and finitary operators. The relationship between them is discussed, in particular via Myhill-Shepherdson's Theorem. Kleene's Least Fixed Point Theorem is also presented. Finally, Part I terminates with a briefi ng on the Turing computational model, Turing reducibility and Turing degrees.

Part II of the book concentrates on applications of computability in several areas namely in logic (undecidability of arithmetic, satisfiability in propositional logic, decidability in modal logic), Euclidean geometry, graphs and Kolmogorov complexity. Nevertheless no previous knowledge of these subjects is required. The essential details for understanding the applications are provided.

Автор: 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.