{"id":"https://openalex.org/W2322071946","doi":"https://doi.org/10.2168/lmcs-12(2:2)2016","title":"Non-Obfuscated Unprovable Programs & Many Resultant Subtleties","display_name":"Non-Obfuscated Unprovable Programs & Many Resultant Subtleties","publication_year":2016,"publication_date":"2016-04-20","ids":{"openalex":"https://openalex.org/W2322071946","doi":"https://doi.org/10.2168/lmcs-12(2:2)2016","mag":"2322071946"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-12(2:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:2)2016","pdf_url":"https://lmcs.episciences.org/1634/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1634/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111850796","display_name":"John Case","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Case","raw_affiliation_strings":["Computer & Information Sciences, University of Delaware, Newark, DE 19716 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer & Information Sciences, University of Delaware, Newark, DE 19716 USA","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009991981","display_name":"Michael Ralston","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Ralston","raw_affiliation_strings":["Computer & Information Sciences, University of Delaware, Newark, DE 19716 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer & Information Sciences, University of Delaware, Newark, DE 19716 USA","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03566529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 12, Issue 2","issue":null,"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.9998000264167786,"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/verifiable-secret-sharing","display_name":"Verifiable secret sharing","score":0.5094617009162903},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5090174674987793},{"id":"https://openalex.org/keywords/universality","display_name":"Universality (dynamical systems)","score":0.4886639416217804},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4738277196884155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46649548411369324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38612106442451477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1477610468864441},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1451599895954132}],"concepts":[{"id":"https://openalex.org/C85847156","wikidata":"https://www.wikidata.org/wiki/Q59015987","display_name":"Verifiable secret sharing","level":3,"score":0.5094617009162903},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5090174674987793},{"id":"https://openalex.org/C183992945","wikidata":"https://www.wikidata.org/wiki/Q2495574","display_name":"Universality (dynamical systems)","level":2,"score":0.4886639416217804},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4738277196884155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46649548411369324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38612106442451477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1477610468864441},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1451599895954132},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-12(2:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:2)2016","pdf_url":"https://lmcs.episciences.org/1634/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1603.09300","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.09300","pdf_url":"https://arxiv.org/pdf/1603.09300","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:f6260cb53b1b4d74aecbddd37d3fb79d","is_oa":true,"landing_page_url":"https://doaj.org/article/f6260cb53b1b4d74aecbddd37d3fb79d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 12, Issue 2 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-12(2:2)2016","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-12(2:2)2016","pdf_url":"https://lmcs.episciences.org/1634/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2322071946.pdf","grobid_xml":"https://content.openalex.org/works/W2322071946.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1498102178","https://openalex.org/W1553920270","https://openalex.org/W1556453281","https://openalex.org/W1574937548","https://openalex.org/W1579083493","https://openalex.org/W1963780006","https://openalex.org/W1984820433","https://openalex.org/W2022959407","https://openalex.org/W2024609530","https://openalex.org/W2041249678","https://openalex.org/W2052456033","https://openalex.org/W2052936500","https://openalex.org/W2056145119","https://openalex.org/W2089442854","https://openalex.org/W2095539596","https://openalex.org/W2112564936","https://openalex.org/W2117832390","https://openalex.org/W2137317612","https://openalex.org/W2530006810","https://openalex.org/W3145128584","https://openalex.org/W3181783642"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2355730523","https://openalex.org/W152021879","https://openalex.org/W2072918937","https://openalex.org/W2365629437","https://openalex.org/W2023935927","https://openalex.org/W2348330439","https://openalex.org/W2350372928","https://openalex.org/W2377292126","https://openalex.org/W2128900334"],"abstract_inverted_index":{"The":[0,69,89,136,187],"\\emph{International":[1],"Obfuscated":[2],"C":[3,17],"Code":[4],"Contest}":[5],"was":[6],"a":[7,30,78,84,146,157],"programming":[8,124,164],"contest":[9],"for":[10,127,145,242,250],"the":[11,101,107,116,132,142,151,180,183,203,214,233,236],"most":[12,209],"creatively":[13],"obfuscated":[14],"yet":[15],"succinct":[16],"code.":[18],"By":[19],"\\emph{contrast},":[20],"an":[21,122,217],"interest":[22],"herein":[23],"is":[24,60,75,109,121,141,240,254],"in":[25,43,95,150,200,213],"programs":[26,64,253],"which":[27,38,128],"are,":[28],"\\emph{in":[29],"sense},":[31],"\\emph{easily}":[32],"seen":[33],"to":[34,211],"be":[35,40,67],"correct,":[36],"but":[37,144,244],"can\\emph{not}":[39],"proved":[41],"correct":[42],"pre-assigned,":[44],"computably":[45],"axiomatized,":[46],"powerful,":[47],"true":[48,230,247],"theories":[49],"{\\bf":[50],"T}.":[51],"A":[52],"point":[53],"made":[54],"by":[55,77],"our":[56],"first":[57,70,90,133],"theorem,":[58],"then,":[59,62,113],"that,":[61],"\\emph{un}verifiable":[63],"need":[65],"\\emph{not}":[66],"obfuscated!":[68],"theorem":[71,91,103,134,138,155,207],"and":[72,98,100,166,170,179,205,223],"its":[73,96,162,174,229],"proof":[74],"followed":[76],"motivated,":[79],"concrete":[80],"example":[81],"based":[82],"on":[83],"remark":[85],"of":[86,106,118,131,159,182,228,235],"Hilary":[87],"Putnam.":[88],"has":[92,156],"some":[93,105,129,168,221],"non-constructivity":[94,108,130],"statement":[97],"proof,":[99],"second":[102],"implies":[104],"inherent.":[110],"That":[111],"result,":[112],"brings":[114],"up":[115],"question":[117],"whether":[119],"there":[120],"acceptable":[123,163,192,218],"system":[125,219],"(numbering)":[126],"disappears.":[135],"third":[137],"shows":[139],"this":[140],"case,":[143],"subtle":[147],"reason":[148],"explained":[149],"text.":[152],"This":[153],"latter":[154],"number":[158],"corollaries,":[160],"regarding":[161,197,226],"system,":[165],"providing":[167],"surprises":[169,196,225],"subtleties":[171],"about":[172,246],"proving":[173,198],"program":[175,231],"properties":[176],"(including":[177],"universality,":[178],"presence":[181],"composition":[184,239],"control":[185,237],"structure).":[186],"next":[188,204],"two":[189],"theorems":[190],"provide":[191],"systems":[193],"with":[194,220],"contrasting":[195],"universality":[199],"them.":[201],"Finally":[202],"last":[206],"(the":[208],"difficult":[210],"prove":[212],"paper)":[215],"provides":[216],"positive":[222],"negative":[224],"verification":[227],"properties:":[232],"existence":[234],"structure":[238],"provable":[241],"it,":[243],"anything":[245],"I/O-program":[248],"equivalence":[249],"syntactically":[251],"unequal":[252],"not":[255],"provable.":[256]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}