{"id":"https://openalex.org/W2972938863","doi":"https://doi.org/10.1007/s00153-019-00692-9","title":"Weaker variants of infinite time Turing machines","display_name":"Weaker variants of infinite time Turing machines","publication_year":2019,"publication_date":"2019-09-13","ids":{"openalex":"https://openalex.org/W2972938863","doi":"https://doi.org/10.1007/s00153-019-00692-9","mag":"2972938863"},"language":"en","primary_location":{"id":"doi:10.1007/s00153-019-00692-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00153-019-00692-9","pdf_url":null,"source":{"id":"https://openalex.org/S188076996","display_name":"Archive for Mathematical Logic","issn_l":"0933-5846","issn":["0933-5846","1432-0665"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Archive for Mathematical Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082913561","display_name":"Matteo Bianchetti","orcid":"https://orcid.org/0000-0002-3253-4387"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matteo Bianchetti","raw_affiliation_strings":["Department of Philosophy, University of Notre Dame, 100 Malloy Hall, Notre Dame, IN, 46556, USA"],"raw_orcid":"https://orcid.org/0000-0002-3253-4387","affiliations":[{"raw_affiliation_string":"Department of Philosophy, University of Notre Dame, 100 Malloy Hall, Notre Dame, IN, 46556, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082913561"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.2,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.55809489,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"59","issue":"3-4","first_page":"335","last_page":"365"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.996399998664856,"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.9926999807357788,"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/transfinite-number","display_name":"Transfinite number","score":0.9619554281234741},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.8244071006774902},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.7188940048217773},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.7168965339660645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6596430540084839},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6268086433410645},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.6049070358276367},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4839951992034912},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47054630517959595},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.45054519176483154},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.44416189193725586},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4433780014514923},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.43930521607398987},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.421672523021698},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41531726717948914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2798182964324951},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2727339267730713},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.26047343015670776},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.10238218307495117}],"concepts":[{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.9619554281234741},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.8244071006774902},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.7188940048217773},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.7168965339660645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6596430540084839},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6268086433410645},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6049070358276367},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4839951992034912},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47054630517959595},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.45054519176483154},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.44416189193725586},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4433780014514923},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.43930521607398987},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.421672523021698},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41531726717948914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2798182964324951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2727339267730713},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.26047343015670776},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.10238218307495117},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00153-019-00692-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00153-019-00692-9","pdf_url":null,"source":{"id":"https://openalex.org/S188076996","display_name":"Archive for Mathematical Logic","issn_l":"0933-5846","issn":["0933-5846","1432-0665"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Archive for Mathematical Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2010728719","https://openalex.org/W2571490773","https://openalex.org/W2962787019"],"related_works":["https://openalex.org/W1760285719","https://openalex.org/W1531426191","https://openalex.org/W3014863312","https://openalex.org/W195780958","https://openalex.org/W1662868588","https://openalex.org/W2037124586","https://openalex.org/W293759077","https://openalex.org/W2257382424","https://openalex.org/W1627143323","https://openalex.org/W2050766716"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}