{"id":"https://openalex.org/W2034478914","doi":"https://doi.org/10.1305/ndjfl/1093893516","title":"Approximation to a decision procedure for the halting problem.","display_name":"Approximation to a decision procedure for the halting problem.","publication_year":1968,"publication_date":"1968-10-01","ids":{"openalex":"https://openalex.org/W2034478914","doi":"https://doi.org/10.1305/ndjfl/1093893516","mag":"2034478914"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093893516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Approximation-to-a-decision-procedure-for-the-halting-problem/10.1305/ndjfl/1093893516.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-9/issue-4/Approximation-to-a-decision-procedure-for-the-halting-problem/10.1305/ndjfl/1093893516.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103248311","display_name":"Michael Anderson","orcid":"https://orcid.org/0000-0002-5229-0447"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Anderson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5103248311"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.29264099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"9","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.16140000522136688,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.16140000522136688,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/halting-problem","display_name":"Halting problem","score":0.6961647272109985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43525534868240356},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3305552005767822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32332295179367065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16628992557525635}],"concepts":[{"id":"https://openalex.org/C137343475","wikidata":"https://www.wikidata.org/wiki/Q622849","display_name":"Halting problem","level":4,"score":0.6961647272109985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43525534868240356},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3305552005767822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32332295179367065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16628992557525635},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093893516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Approximation-to-a-decision-procedure-for-the-halting-problem/10.1305/ndjfl/1093893516.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/1093893516","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093893516","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/1093893516","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093893516","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-9/issue-4/Approximation-to-a-decision-procedure-for-the-halting-problem/10.1305/ndjfl/1093893516.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":[{"score":0.6299999952316284,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2034478914.pdf","grobid_xml":"https://content.openalex.org/works/W2034478914.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1483568252","https://openalex.org/W1566493102","https://openalex.org/W2051342369","https://openalex.org/W2154640398","https://openalex.org/W2161843469","https://openalex.org/W4254397836","https://openalex.org/W6663539126","https://openalex.org/W6683743317","https://openalex.org/W6724886606"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2130071582","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694"],"abstract_inverted_index":{"Both":[0],"the":[1,5,42,57,81,89,97,108,114,124,147,157,163,197,201,205,212,219,255,261,274,281,304],"Halting":[2],"Problem":[3,7],"and":[4,69,73,103,107,235,243,252,265,308],"Immortality":[6],"for":[8,15,101,105,113,123,239,254],"Turing":[9,20],"machines":[10,61,67,76,127],"(to":[11],"provide":[12],"an":[13],"algorithm":[14],"determining":[16,45],"if":[17,46],"a":[18,25,47,139,171,177,184,191,271],"given":[19,26,79],"machine":[21,48,84,159,172,187],"will":[22,77,128,152,165],"stop":[23,125],"on":[24,52,130,135],"input":[27],"or,":[28],"respectively,":[29],"any":[30,53],"input)":[31,54],"have":[32],"been":[33],"shown":[34],"to":[35,155,169,230,249],"be":[36,78,153,167],"unsolvable.In":[37],"this":[38,161,278,292],"paper":[39,282,293],"we":[40,188],"consider":[41,156],"problem":[43],"of":[44,83,88,142,179,183,200,224,263,273,280,291,299,303],"is":[49,247,294],"mortal":[50],"(stops":[51],"solely":[55],"from":[56],"machine's":[58],"state":[59,109,117,198,289],"instructions.The":[60],"considered":[62],"here":[63],"are":[64,92],"two":[65,131],"symbol":[66],"(0":[68],"1)":[70],"with":[71,218,258,269,301],"right":[72,102],"left":[74],"shift.Particular":[75],"in":[80,119,146,204,216,221,277,286],"form":[82],"tables.At":[85],"each":[86,186],"entry":[87],"table":[90],"there":[91],"three":[93],"instructions-the":[94],"print":[95],"instruction,":[96],"shift":[98],"instruction":[99,110],"(1":[100],"-1":[104],"left),":[106],"(q":[111],"{":[112],"I":[115],"th":[116],"and,":[118],"particular,":[120],"q":[121],"Q":[122],"state).The":[126],"operate":[129],"way":[132],"infinite":[133],"tapes":[134],"which":[136],"appear":[137],"only":[138],"finite":[140],"number":[141],"strokes.At":[143],"many":[144],"points":[145],"work":[148],"that":[149,298],"follows":[150],"it":[151],"unnecessary":[154],"complete":[158],"table.When":[160],"occurs":[162],"instructions":[164],"still":[166],"referred":[168,248],"as":[170],"although":[173],"they":[174],"actually":[175],"determine":[176],"set":[178],"machines.The":[180],"State":[181],"Tree":[182],"Machine.With":[185],"can":[189],"associate":[190],"dyadic":[192],"tree":[193,199,290],"1":[194],",":[195],"called":[196],"machine,":[202],"constructed":[203],"following":[206],"way:\u2022This":[207],"research":[208],"was":[209],"done":[210],"during":[211],"school":[213],"year":[214],"1966-67":[215],"conjunction":[217],"Seminar":[220],"Symbolic":[222],"Logic":[223],"Prof.":[225,232,236],"B.":[226,233],"Soboci\u03aeski.I":[227],"would":[228],"like":[229],"thank":[231],"Soboci\u03aeski":[234],"V.":[237],"Vuckovic*":[238],"their":[240],"kind":[241],"encouragement":[242],"assistance.1)":[244],"The":[245],"reader":[246],"[1],":[250],"[2],":[251],"[5]":[253,284,300],"terminology":[256],"connected":[257],"trees.We":[259],"assume":[260],"concepts":[262],"length":[264],"order":[266],"ordinarily":[267],"associated":[268],"trees.For":[270],"development":[272],"structural":[275],"propositions":[276],"section":[279],"see":[283],"pp.181-197,":[285],"particular":[287],"pp.190-191.The":[288],"nothing":[295],"more":[296],"than":[297],"some":[302],"structure":[305],"stripped":[306],"off":[307],"paths":[309],"cut":[310],"down.":[311]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}