The Intrinsic Computational Difficulty of Functions

In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270886

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,733

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

The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.
Cobham recursive set functions.Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller & Neil Thapen - 2016 - Annals of Pure and Applied Logic 167 (3):335-369.
Alan Cobham. Some remarks concerning theories with recursively enumerable complements. The journal of symbolic logic, vol. 28 no. 1 , pp. 72–74. [REVIEW]W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):255-255.
Robert L. Vaught. On a theorem of Cobham concerning undecidable theories. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 14–25. [REVIEW]Verena H. Dyson - 1969 - Journal of Symbolic Logic 34 (1):126-127.
Free Sets for Commutative Families of Functions.Uri Abraham - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
Polarized Partition Relations and Almost-Disjoint Functions.James E. Baumgartner - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
Cobham Alan. Effectively decidable theories. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, NJ, 1960, pp. 391–395. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (4):653-653.
Consciousness defies scientific and computational reduction.Jan M. Żytkow - 1998 - Foundations of Science 3 (1):83-101.

Analytics

Added to PP
2015-02-05

Downloads
497 (#56,032)

6 months
49 (#102,040)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Quantum computing.Amit Hagar & Michael Cuffaro - 2019 - Stanford Encyclopedia of Philosophy.

View all 31 citations / Add more citations

References found in this work

No references found.

Add more references