Learn IT - Books tags computability

Computability Theory: An Introduction to Recursion Theory

Academic Press, 2010

The study of the class of computable partial functions (i.e., recursive partial functions) stands at the intersection of three fields: mathematics, theoretical computer science, and philosophy.

Mathematically, computability theory originates from the concept of an algorithm. It leads to a classification of functions according...

Algorithmic Randomness and Complexity (Theory and Applications of Computability)

Springer, 2010

Though we did not know it at the time, this book’s genesis began with the arrival of Cris Calude in New Zealand. Cris has always had an intense interest in algorithmic information theory. The event that led to much of the recent research presented here was the articulation by Cris of a seemingly innocuous question. This question...

On the Brink of Paradox: Highlights from the Intersection of Philosophy and Mathematics (The MIT Press)

MIT Press, 2019

An introduction to awe-inspiring ideas at the brink of paradox: infinities of different sizes, time travel, probability and measure theory, and computability theory.

This award-winning book introduces the reader to awe-inspiring issues at the intersection of philosophy and mathematics. It explores ideas at the...

New Computational Paradigms: Changing Conceptions of What is Computable

Springer, 2007

In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics. The deep interconnection between "computation" and "proof" has originated much of the most significant work in constructive mathematics and mathematical...

Models of Computation: Exploring the Power of Computing

Addison Wesley, 1998

Your book fills the gap which all of us felt existed too long. Congratulations on this excellent contribution to our field."

--Jan van Leeuwen, Utrecht University

"This is an impressive book. The subject has been thoroughly researched and carefully presented. All the machine models central to the modern theory of...

The Annotated Turing: A Guided Tour Through Alan Turing's Historic Paper on Computability and the Turing Machine

John Wiley & Sons, 2008

Before digital computers ever existed, Alan Turing envisioned their power and versatility...but also proved what computers could never do.

In an extraordinary and ultimately tragic life that unfolded like a novel, Turing helped break the German Enigma code to turn the tide of World War II, later speculated on...

Philosophy of Mathematics (Handbook of the Philosophy of Science)

North Holland, 2009

One of the most striking features of mathematics is the fact that we are much more certain about the mathematical knowledge we have than about what mathematical knowledge is knowledge of. Are numbers, sets, functions and groups physical entities of some kind? Are they objectively existing objects in some non-physical, mathematical realm? Are...

Computability and Complexity Theory (Texts in Computer Science)

Springer, 2001

The theory of computing provides computer science with concepts, models, and formalisms for reasoning about both the resources needed to carry out computations and the efficiency of the computations that use these resources. It provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other...

Elementary Computability, Formal Languages, and Automata

Prentice Hall, 1981

This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability {how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata {idealized computer devices) are used as precise...

Proofs and Algorithms: An Introduction to Logic and Computability (Undergraduate Topics in Computer Science)

Springer, 2011

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...

An Invitation to Analytic Combinatorics: From One to Several Variables (Texts & Monographs in Symbolic Computation)

Springer, 2020

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use...

Handbook of Network and System Administration

Elsevier Limited, 2007

System administration is about the design, running and maintenance of human-computer systems. Examples of human-computer systems include business enterprises, service institutions and any extensive machinery that is operated by, or interacts with human beings. System administration is often thought of as the technological side of a system: the...

Result Page: 3 2 1