Computability of Recursive Functions 论文

1963Journal of the ACM引用 404
Computability, Logic, AI Algorithmssemigroups and automata theoryAlgorithms and Data Compression

摘要

article Free Access Share on Computability of Recursive Functions Authors: J. C. Shepherdson University of Bristol, England and University of California, Berkeley University of Bristol, England and University of California, BerkeleyView Profile , H. E. Sturgis University of California, Berkeley University of California, BerkeleyView Profile Authors Info & Claims Journal of the ACMVolume 10Issue 2April 1963 pp 217–255https://doi.org/10.1145/321160.321170Published:01 April 1963Publication History 298citation1,685DownloadsMetricsTotal Citations298Total Downloads1,685Last 12 Months134Last 6 weeks25 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF