{"id":"https://openalex.org/W3028901970","doi":"https://doi.org/10.23638/lmcs-16(2:2)2020","title":"Reachability for infinite time Turing machines with long tapes","display_name":"Reachability for infinite time Turing machines with long tapes","publication_year":2020,"publication_date":"2020-04-24","ids":{"openalex":"https://openalex.org/W3028901970","doi":"https://doi.org/10.23638/lmcs-16(2:2)2020","mag":"3028901970"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-16(2:2)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:2)2020","pdf_url":null,"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","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.23638/lmcs-16(2:2)2020","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012757472","display_name":"Merlin Carl","orcid":"https://orcid.org/0000-0003-0010-2034"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Merlin Carl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033349409","display_name":"Benjamin Rin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Rin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003413515","display_name":"Philipp Schlicht","orcid":"https://orcid.org/0000-0001-7736-7466"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philipp Schlicht","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7736-7466","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012757472"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08883037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 16, Issue 2","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.9993000030517578,"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.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"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/T11567","display_name":"semigroups and automata theory","score":0.9941999912261963,"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/uncountable-set","display_name":"Uncountable set","score":0.7252197265625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.65913325548172},{"id":"https://openalex.org/keywords/regular-cardinal","display_name":"Regular cardinal","score":0.6250948905944824},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.6171463131904602},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.5331159234046936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4663746953010559},{"id":"https://openalex.org/keywords/alpha","display_name":"Alpha (finance)","score":0.4635068476200104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4405856132507324},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.43202993273735046},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.4238869547843933},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.24462848901748657}],"concepts":[{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.7252197265625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.65913325548172},{"id":"https://openalex.org/C89507440","wikidata":"https://www.wikidata.org/wiki/Q1193137","display_name":"Regular cardinal","level":2,"score":0.6250948905944824},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.6171463131904602},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.5331159234046936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4663746953010559},{"id":"https://openalex.org/C64943373","wikidata":"https://www.wikidata.org/wiki/Q2651003","display_name":"Alpha (finance)","level":4,"score":0.4635068476200104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4405856132507324},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.43202993273735046},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.4238869547843933},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.24462848901748657},{"id":"https://openalex.org/C49453240","wikidata":"https://www.wikidata.org/wiki/Q1592163","display_name":"Construct validity","level":3,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C171606756","wikidata":"https://www.wikidata.org/wiki/Q506132","display_name":"Psychometrics","level":2,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.23638/lmcs-16(2:2)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:2)2020","pdf_url":null,"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:research-information.bris.ac.uk:openaire/8cb0f5c1-a0bf-4f66-acd1-972e53e1e5d6","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/8cb0f5c1-a0bf-4f66-acd1-972e53e1e5d6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Carl, M, Rin, B & Schlicht , P 2020, 'Reachability for infinite time Turing machines with long tapes', Logical Methods in Computer Science, vol. 16, no. 2. https://doi.org/10.23638/LMCS-16(2:2)2020","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1802.05734","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1802.05734","pdf_url":"https://arxiv.org/pdf/1802.05734","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:kops.uni-konstanz.de:123456789/50848","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-ytm4xcfbzcf43","pdf_url":"http://arxiv.org/abs/1802.05734","source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/8cb0f5c1-a0bf-4f66-acd1-972e53e1e5d6","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/8cb0f5c1-a0bf-4f66-acd1-972e53e1e5d6","pdf_url":"https://research-information.bris.ac.uk/files/245004290/Full_text_PDF_final_published_version_.pdf","source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Carl, M, Rin, B & Schlicht , P 2020, 'Reachability for infinite time Turing machines with long tapes', Logical Methods in Computer Science, vol. 16, no. 2. https://doi.org/10.23638/LMCS-16(2:2)2020","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:6d2fb1ef22cd489bab2670ac03ac74f8","is_oa":true,"landing_page_url":"https://doaj.org/article/6d2fb1ef22cd489bab2670ac03ac74f8","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 16, Issue 2 (2020)","raw_type":"article"},{"id":"pmh:oai:usiena-air.unisi.it:11365/1277404","is_oa":true,"landing_page_url":"https://hdl.handle.net/11365/1277404","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1802.05734","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1802.05734","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:3028901970","is_oa":true,"landing_page_url":"https://dblp.uni-trier.de/db/journals/lmcs/lmcs16.html#CarlRS20","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Logical Methods in Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.23638/lmcs-16(2:2)2020","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-16(2:2)2020","pdf_url":null,"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":[{"id":"https://openalex.org/G3754148671","display_name":null,"funder_award_id":"794020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3100257129","https://openalex.org/W3193607549","https://openalex.org/W2788996312","https://openalex.org/W2811317784","https://openalex.org/W1990176504","https://openalex.org/W2786120015","https://openalex.org/W850465257","https://openalex.org/W2099285593","https://openalex.org/W1975020978","https://openalex.org/W2009880057","https://openalex.org/W1523156221","https://openalex.org/W2967571932","https://openalex.org/W2986235005","https://openalex.org/W2071293683","https://openalex.org/W1862878060","https://openalex.org/W2963507322","https://openalex.org/W2051758697","https://openalex.org/W2264138875","https://openalex.org/W2477631927","https://openalex.org/W2198076835"],"abstract_inverted_index":{"Infinite":[0],"time":[1],"Turing":[2],"machine":[3],"models":[4],"with":[5,19,74,119],"tape":[6,20],"length":[7,21,124],"$\\alpha$,":[8,32],"denoted":[9],"$T_\\alpha$,":[10],"strengthen":[11],"the":[12,52,55,71,77,100,112,129,140,153,162,170,173],"machines":[13],"of":[14,39,54,76,92,114,123,139,161,172],"Hamkins":[15],"and":[16,132,144],"Kidder":[17],"[HL00]":[18],"$\\omega$.":[22,93],"A":[23],"new":[24],"phenomenon":[25],"is":[26,70,85,96,105,150,157],"that":[27,148,155],"for":[28],"some":[29,33,82],"countable":[30],"ordinals":[31,141],"cells":[34],"cannot":[35],"be":[36],"halting":[37],"positions":[38],"$T_\\alpha$":[40],"given":[41],"trivial":[42],"input.":[43],"The":[44],"main":[45],"open":[46],"question":[47],"in":[48,99,107,152],"[Rin14]":[49],"asks":[50],"about":[51],"size":[53],"least":[56,72],"such":[57],"ordinal":[58,73],"$\\delta$.":[59],"We":[60,126],"answer":[61],"this":[62],"by":[63],"providing":[64],"various":[65],"characterizations.":[66],"For":[67,81],"instance,":[68],"$\\delta$":[69,149],"any":[75],"following":[78],"properties:":[79],"(a)":[80],"$\\xi<\\alpha$,":[83],"there":[84],"a":[86,97,120,158],"$T_\\xi$-writable":[87],"but":[88],"not":[89],"$T_\\alpha$-writable":[90,101,115,121],"subset":[91],"(b)":[94],"There":[95],"gap":[98],"ordinals.":[102,176],"(c)":[103],"$\\alpha$":[104],"uncountable":[106],"$L_{\\lambda_\\alpha}$.":[108],"Here":[109],"$\\lambda_\\alpha$":[110],"denotes":[111,169],"supremum":[113,171],"ordinals,":[116],"i.e.":[117],"those":[118],"code":[122],"$\\alpha$.":[125],"further":[127],"use":[128],"above":[130],"characterizations,":[131],"an":[133],"analogue":[134],"to":[135,146],"Welch's":[136],"submodel":[137],"characterization":[138],"$\\lambda$,":[142],"$\\zeta$":[143],"$\\Sigma$,":[145],"show":[147],"large":[151],"sense":[154],"it":[156],"closure":[159],"point":[160],"function":[163],"$\\alpha":[164],"\\mapsto":[165],"\\Sigma_\\alpha$,":[166],"where":[167],"$\\Sigma_\\alpha$":[168],"$T_\\alpha$-accidentally":[174],"writable":[175]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}