The Intrinsic Computational Difficulty of Functions

In Yehoshua Bar-Hillel (ed.), Logic, Methodology and Philosophy of Science: Proceedings of the 1964 International Congress (Studies in Logic and the Foundations of Mathematics). North-Holland Publishing. pp. 24-30 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.
Elementary arithmetic.Geoffrey E. Ostrin & Stanley S. Wainer - 2005 - Annals of Pure and Applied Logic 133 (1):275-292.
Classifying the provably total functions of pa.Andreas Weiermann - 2006 - Bulletin of Symbolic Logic 12 (2):177-190.
Comparing Computational Power.Udi Boker & Nachum Dershowitz - 2006 - Logic Journal of the IGPL 14 (5):633-647.
Computational modeling of analogy: Destined ever to only be metaphor?Ann Speed - 2008 - Behavioral and Brain Sciences 31 (4):397-398.
The structure of intrinsic complexity of learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
Rethinking intrinsic value.Shelly Kagan - 1998 - The Journal of Ethics 2 (4):277-297.

Analytics

Added to PP
2015-02-05

Downloads
410 (#43,912)

6 months
46 (#77,970)

Historical graph of downloads
How can I increase my downloads?