{"id":"https://openalex.org/W2032986638","doi":"https://doi.org/10.1305/ndjfl/1093888323","title":"A note on Turing machine regularity and primitive recursion.","display_name":"A note on Turing machine regularity and primitive recursion.","publication_year":1978,"publication_date":"1978-04-01","ids":{"openalex":"https://openalex.org/W2032986638","doi":"https://doi.org/10.1305/ndjfl/1093888323","mag":"2032986638"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093888323","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888323","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-2/A-note-on-Turing-machine-regularity-and-primitive-recursion/10.1305/ndjfl/1093888323.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-2/A-note-on-Turing-machine-regularity-and-primitive-recursion/10.1305/ndjfl/1093888323.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009986390","display_name":"Nicholas J. De Lillo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nicholas J. De Lillo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5009986390"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17221317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9620000123977661,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9370999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7172799706459045},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6732260584831238},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.614716112613678},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.593974769115448},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.581702709197998},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5287729501724243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5095558166503906},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.4735414385795593},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.44061028957366943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4040106534957886},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3115980625152588},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2760794460773468},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.042276620864868164}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7172799706459045},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6732260584831238},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.614716112613678},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.593974769115448},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.581702709197998},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5287729501724243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5095558166503906},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.4735414385795593},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.44061028957366943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4040106534957886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3115980625152588},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2760794460773468},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.042276620864868164}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093888323","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888323","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-2/A-note-on-Turing-machine-regularity-and-primitive-recursion/10.1305/ndjfl/1093888323.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093888323","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093888323","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1305/ndjfl/1093888323","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888323","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-19/issue-2/A-note-on-Turing-machine-regularity-and-primitive-recursion/10.1305/ndjfl/1093888323.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2032986638.pdf","grobid_xml":"https://content.openalex.org/works/W2032986638.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W571574236","https://openalex.org/W2797656628"],"related_works":["https://openalex.org/W3014863312","https://openalex.org/W293759077","https://openalex.org/W195780958","https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W1526857708","https://openalex.org/W2348596562","https://openalex.org/W2119421720","https://openalex.org/W2556768775","https://openalex.org/W68480898"],"abstract_inverted_index":{"Using":[0],"the":[1,24],"terminology":[2],"of":[3,26],"[":[4],"1":[5],"],":[6],"this":[7],"paper":[8],"will":[9],"deal":[10],"only":[11],"with":[12],"simple":[13],"Turing":[14],"machines,":[15],"but":[16],"these":[17],"results":[18],"can":[19],"easily":[20],"be":[21],"generalized":[22],"to":[23],"case":[25],"relative":[27],"computability.":[28]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}