Algorithms and Decision Problems: a Crash Course in Recursion Theory

Journal of Symbolic Logic 54 (3):1094-1095 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

How to think about algorithms.Jeff Edmonds - 2008 - New York: Cambridge University Press.
Quantum hypercomputation—hype or computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.
On the existence of fair matching algorithms.F. Masarani & S. S. Gokturk - 1989 - Theory and Decision 26 (3):305-322.
Some counterexamples to causal decision theory.Andy Egan - 2007 - Philosophical Review 116 (1):93-114.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.

Analytics

Added to PP
2015-02-05

Downloads
17 (#815,534)

6 months
4 (#678,769)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dirk Van Dalen
Utrecht University

Citations of this work

Alonzo church:his life, his work and some of his miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.

Add more citations

References found in this work

No references found.

Add more references