The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

New to eBooks.com?

Learn more
Browse our categories
  • Bestsellers - This Week
  • Foreign Language Study
  • Pets
  • Bestsellers - Last 6 months
  • Games
  • Philosophy
  • Archaeology
  • Gardening
  • Photography
  • Architecture
  • Graphic Books
  • Poetry
  • Art
  • Health & Fitness
  • Political Science
  • Biography & Autobiography
  • History
  • Psychology & Psychiatry
  • Body Mind & Spirit
  • House & Home
  • Reference
  • Business & Economics
  • Humor
  • Religion
  • Children's & Young Adult Fiction
  • Juvenile Nonfiction
  • Romance
  • Computers
  • Language Arts & Disciplines
  • Science
  • Crafts & Hobbies
  • Law
  • Science Fiction
  • Current Events
  • Literary Collections
  • Self-Help
  • Drama
  • Literary Criticism
  • Sex
  • Education
  • Literary Fiction
  • Social Science
  • The Environment
  • Mathematics
  • Sports & Recreation
  • Family & Relationships
  • Media
  • Study Aids
  • Fantasy
  • Medical
  • Technology
  • Fiction
  • Music
  • Transportation
  • Folklore & Mythology
  • Nature
  • Travel
  • Food and Wine
  • Performing Arts
  • True Crime
  • Foreign Language Books
Recursion theory

Most popular at the top

  • Recursion Theory for Metamathematicsby Raymond M. Smullyan

    Oxford University Press 1993; US$ 139.99

    This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is... more...

  • Godel's Incompleteness Theoremsby Raymond M. Smullyan

    Oxford University Press 1992; US$ 209.99

    An introduction to the work of the mathematical logician Kurt Godel, which guides the reader through his Theorem of Undecidability and his theories on the completeness of logic, the incompleteness of numbers and the consistency of the axiom of choice. more...

  • Introduction to Fuzzy Logic using MATLABby S.N. Sivanandam; S. Sumathi; S. N. Deepa

    Springer 2006; US$ 129.00

    Starting with an overview of the field of Fuzzy Logic, this book then discusses the basic principles of Fuzzy Logic, along with various solved examples. It also deals with the applications of Fuzzy Logic, so as to make the readers understand the concept. It also provides solutions to the problems, which are programmed using MATLAB 6.0. more...

  • Super-Recursive Algorithmsby Mark Burgin

    Springer 2006; US$ 169.00

    Provides an examination of the theory of super-recursive algorithms and its ramifications for the computer industry, networks, artificial intelligence, embedded systems, and the Internet. This book demonstrates how these algorithms are more appropriate as mathematical models for modern computers. more...

  • Goguen Categoriesby Michael Winter

    Springer 2007; US$ 209.00

    Goguen categories extend the relational calculus and its categorical formalization to the fuzzy world. Starting from the fundamental concepts of sets, binary relations and lattices this book introduces several categorical formulations of an abstract theory of relations such as allegories, Dedekind categories and related structures. It is shown that... more...

  • Recursive Functionalsby L.E. Sanchis

    Elsevier Science 1992; US$ 72.95

    This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers.... more...

  • Fundamentals of Generalized Recursion Theoryby M. Fitting

    Elsevier Science 2011; US$ 200.00

    This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods... more...

  • Computability Theoryby Herbert B. Enderton

    Elsevier Science 2010; US$ 79.95

    Computability Theory:  An Introduction to Recursion Theory,  provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized... more...

  • Recursion Theory, its Generalisations and Applicationsby F. R. Drake; S. S. Wainer

    Cambridge University Press 1980; US$ 104.00

    This book is a collection of advanced research/survey papers by eminent research workers in the Recursion theory. more...

  • Computability, Enumerability, Unsolvabilityby S. B. Cooper; T. A. Slaman; S. S. Wainer

    Cambridge University Press 1996; US$ 78.00

    Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. more...