article

Free access

Computability of Recursive Functions

Authors:

J. C. Shepherdson,

H. E. SturgisAuthors Info & Claims

Journal of the ACM (JACM), Volume 10, Issue 2

Pages 217 - 255

https://doi.org/10.1145/321160.321170

Published: 01 April 1963 Publication History

PDF eReader

References

[1]

CHURCH, A. A set of postulates for the foundation of logic. Ann. Math. {2} 33 (1932), 346-366; 34 (1933).

Google Scholar

[2]

----. An unsolvable problem of elementary number theory. Amer. J. Math. 58 (1936), 345--363.

Google Scholar

[3]

--. A note on the Entscheidungsproblem. J. Symb. Logic 1 (1936), 40-41, 101--102.

Google Scholar

[4]

DAvis, M: Computability and Unsolvability. New York, 1958.

Google Scholar

[5]

ERsov, A.P. On operator algorithms. (Russian) Dok. Akad. Nauk 122 (1958), 967- 970. English translation, Automat. Express 1 (1959), 20-23.

Google Scholar

[6]

HERMES, I-I. Vorlesung ber Entscheidungsproblemen inn Mathematih rend Logik. Ausarb. Math. Phys. Vorlesungen, Vol. 15. Munster, 1955.

Google Scholar

[7]

HERMES, H. Die Universalitiit programmgesteuerter Rechenmaschinen. Math.-Phys. Semsterberichte (G5ttingen) 41 (1954), 42-53.

Google Scholar

[8]

KAPHENGST, H. Eine Abstrakte programmgesteuerte Rechenmasehine. Zeit. Math. Logik Grund. d. Math: 5 (1959), 366-379.

Google Scholar

[9]

KLEENE, S.C. General recursive functions of natural numbers, Math. Ann. 112 (1936), 727-742.

Google Scholar

[10]

----. A theory of positive integers in formal logic. Amer. J. Math. 57 (1935), 153-173, 219-244.

Google Scholar

[11]

----. h-definability and reeursiveness. Duke Math. J. 2 (1936), 340-353.

Google Scholar

[12]

----. Introduction to Metamathematics, Ch. 13. Princeton, 1952.

Google Scholar

[13]

5'LRov, A. A. Teoriya algorifmov. Tr. Mat. Inst. Steklov, No. 42. Moscow, 1954.

Google Scholar

[14]

Omnsci-nI, W. Varianten yon T'aringmaschinen, Arch. math. Logik Grund., No. 4/I-2 (1958), 53-62.

Google Scholar

[15]

PiTER, R. Graphschemata and rekurive Funktionen, Dialectica 12 (1958), 373.

Google Scholar

[16]

POST, E. L. Finite combinatory processes--formulation, I. J. Symb. Logic 1 (1936), 103-t05.

Google Scholar

[17]

---. Formal reductions of the general combinatorial decision problem. Amer. J. Math. 65 (t943), 197-215.

Google Scholar

[18]

TUmNG, A. M. On computable numbers with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. {2}, 42 (1936-7), 230-265; addendum and corrigendum, 43 (1937), 544-546.

Google Scholar

[19]

----. Computability and X-definability. J. ymb. Logic 2 (1937), 153-163.

Google Scholar

[20]

WANQ, H. A variant to Turing's theory of computing machines. J. ACM 4 (1957), 63-92.

Crossref

Google Scholar

[21]

MINsz, M. Recursive unsolwbility of Post's problem. M.I.T. Lincoln Lab. Report 54G-0023.

Google Scholar

[22]

S.WLLY.XN, R. Jl. Theory of Formal Systems. Princeton, 1961.

Google Scholar

[23]

POST, E.L. Recursive unsolvability of a problem of Thue. J. Symb. Logic 12 (1947), 1-11.

Google Scholar

[24]

LE C.Y. Categorizing automata by W-machine programs. J. ACM 8 (1961), 384-399.

Crossref

Google Scholar

Cited By

View all

Schardong FCustodio RHong JPark J(2024)From Self-Sovereign Identity to Fiduciary Identity: A Journey Towards Greater User Privacy and UsabilityProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3636061(687-694)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3636061
Scharf CWitkowski O(2024)Rebuilding the Habitable Zone from the Bottom up with Computational ZonesAstrobiology10.1089/ast.2023.003524:6(613-627)Online publication date: 1-Jun-2024
https://doi.org/10.1089/ast.2023.0035
Berthomieu BZaitsev D(2024)Sleptsov nets are Turing-completeTheoretical Computer Science10.1016/j.tcs.2023.114346986(114346)Online publication date: Feb-2024
https://doi.org/10.1016/j.tcs.2023.114346
Show More Cited By

Index Terms

Computability of Recursive Functions
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
2. Theory of computation
  1. Models of computation
    1. Computability
      1. Recursive functions

Recommendations

Type-2 Computability and Moore's Recursive Functions

Regarding effectivity of functions on the reals, there have been several proposed models of analog, continuous-time computation, as opposed to the digital, discrete nature of the type-2 computability. We study one of them, Moore's real (primitive) ...
On the computability of Walsh functions

The Haar and the Walsh functions are proved to be computable with respect to the Fine-metric d_F which is induced from the infinite product Ω = {0,1}{^1,2,...} with the weighted product metric d_C of the discrete metric on {0, 1}. Although they are ...
On a relative computability notion for real functions
CiE'11: Proceedings of the 7th conference on Models of computation in context: computability in Europe

For any class of total functions in the set of natural numbers, we define what it means for a real function to be conditionally computable with respect to this class. This notion extends a notion of relative uniform computability of real functions ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 10, Issue 2

April 1963

134 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321160

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1963

Published in JACM Volume 10, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

312
Total Citations
View Citations
2,217
Total Downloads

Downloads (Last 12 months)249
Downloads (Last 6 weeks)32

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schardong FCustodio RHong JPark J(2024)From Self-Sovereign Identity to Fiduciary Identity: A Journey Towards Greater User Privacy and UsabilityProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3636061(687-694)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3605098.3636061
Scharf CWitkowski O(2024)Rebuilding the Habitable Zone from the Bottom up with Computational ZonesAstrobiology10.1089/ast.2023.003524:6(613-627)Online publication date: 1-Jun-2024
https://doi.org/10.1089/ast.2023.0035
Berthomieu BZaitsev D(2024)Sleptsov nets are Turing-completeTheoretical Computer Science10.1016/j.tcs.2023.114346986(114346)Online publication date: Feb-2024
https://doi.org/10.1016/j.tcs.2023.114346
Marker DMarker D(2024)Models of ComputationAn Invitation to Mathematical Logic10.1007/978-3-031-55368-4_9(141-162)Online publication date: 7-May-2024
https://doi.org/10.1007/978-3-031-55368-4_9
Schilling CLukina ADemirović ELarsen KOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Safety verification of decision-tree policies in continuous timeProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3666772(14750-14769)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3666772
Zaitsev D(2023)Strong Sleptsov nets are Turing completeInformation Sciences: an International Journal10.1016/j.ins.2022.11.098621:C(172-182)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.ins.2022.11.098
Bingmann TDinklage PFischer JKurpicz FOhlebusch ESanders P(2023)Scalable Text Index ConstructionAlgorithms for Big Data10.1007/978-3-031-21534-6_14(252-284)Online publication date: 18-Jan-2023
https://doi.org/10.1007/978-3-031-21534-6_14
Damasio TCanesche MPacheco VFaustino AQuintao Pereira F(2022)Impacto de Ofuscadores e Otimizadores de Código na Acurácia de Classificadores de ProgramasProceedings of the XXVI Brazilian Symposium on Programming Languages10.1145/3561320.3561322(68-75)Online publication date: 6-Oct-2022
https://dl.acm.org/doi/10.1145/3561320.3561322
Sane AMody RLaxminarayan AVK JBecker BQuille KLaakso MBarendsen ESimon (2022)Lifecycle in CS1Proceedings of the 27th ACM Conference on on Innovation and Technology in Computer Science Education Vol. 110.1145/3502718.3524798(269-275)Online publication date: 7-Jul-2022
https://dl.acm.org/doi/10.1145/3502718.3524798
Gao ZJain SLi ZSabili AStephan F(2022)Alternating Automatic Register MachinesTheoretical Aspects of Computing – ICTAC 202210.1007/978-3-031-17715-6_14(195-211)Online publication date: 27-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-17715-6_14
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Type-2 Computability and Moore's Recursive Functions

On the computability of Walsh functions

On a relative computability notion for real functions

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations