



Computability Theory: An Introduction to Recursion Theory
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...   Computability and Complexity Theory (Texts in Computer Science)
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is selfcontained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of...   Foundations of Computing
It may sound surprising that in computing, a field which develops so fast that the future often becomes the past without having been the present, there is nothing more stable and worthwhile learning than its foundations.
It may sound less surprising that in a field with such a revolutionary methodological impact on all sciences and... 

  New Computational Paradigms: Changing Conceptions of What is ComputableIn 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...   

From Writing to Computers... the broad and clear analysis of writing and language, and of automata theory, formal logic, and computability theory he uses to reach [his conclusion] is well worth reading. –H. D. Warner, Western New England College
From Writing to Computers takes as its central theme the issue of a...   Elementary Computability, Formal Languages, and Automata
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...   Philosophy of Mathematics (Handbook of the Philosophy of Science)
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 nonphysical, mathematical realm? Are... 

  Computational Prospects Of Infinity  Part I: Tutorials (Lecture Notes)This volume presents the written versions of the tutorial lectures given at the Workshop on Computational Prospects of Infinity, held from 18 June to 15 August 2005 at the Institute for Mathematical Sciences, National University of Singapore. It consists of articles by four of the leading experts in recursion theory (computability theory) and set...   


Result Page: 3 2 1 