Computability and Complexity: From a Programming Perspective Vol. 21

MIT Press (1997)
  Copy   BIBTEX

Abstract

This makes his book especially valuable." -- Yuri Gurevich, Professor of Computer Science, University of Michigan Computability and complexity theory should be of central concern to practitioners as well as theorists.

Categories

Keywords

Reprint years

ISBN(s)

0262100649   9780262100649

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Introduction to Computability Theory.D. Normann - 2010
Computability theory, semantics, and logic programming.Melvin Fitting - 1987 - Oxford: Clarendon Press.
Computability Theory.S. Barry Cooper - 2003 - Chapman & Hall.
Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
Computability and complexity.Neil Immerman - 2008 - Stanford Encyclopedia of Philosophy.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
Book review: Melvin Fitting. Computability theory, semantics, and logic programming. [REVIEW]Martin Davis - 1990 - Notre Dame Journal of Formal Logic 31 (3):485-486.
Computability, Complexity and Languages.Martin Davies, Ron Segal & Elaine Weyuker - 1994 - Academic Press.
Remarks on the development of computability.Stewart Shapiro - 1983 - History and Philosophy of Logic 4 (1-2):203-220.
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.
Computability in Quantum Mechanics.Wayne C. Myrvold - 1995 - In Werner De Pauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), Vienna Circle Institute Yearbook. Kluwer Academic Publishers. pp. 33-46.
Computability, enumerability, unsolvability: directions in recursion theory.S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) - 1996 - New York: Cambridge University Press.
A first course in logic: an introduction to model theory, proof theory, computability, and complexity.Shawn Hedman - 2004 - New York: Oxford University Press.

Analytics

Added to PP
2013-09-06

Downloads
41 (#385,098)

6 months
7 (#418,756)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A decidable timeout-based extension of linear temporal logic.Janardan Misra & Suman Roy - 2014 - Journal of Applied Non-Classical Logics 24 (3):262-291.

Add more citations

References found in this work

No references found.

Add more references