Get quick answers to your questions about the article from our AI researcher chatbot
{'id': 'https://openalex.org/W2210317531', 'doi': 'https://doi.org/10.1109/9780470544242.ch53', 'title': 'A Universal Turing Machine with Two Internal States', 'display_name': 'A Universal Turing Machine with Two Internal States', 'publication_year': 2009, 'publication_date': '2009-01-01', 'ids': {'openalex': 'https://openalex.org/W2210317531', 'doi': 'https://doi.org/10.1109/9780470544242.ch53', 'mag': '2210317531'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/9780470544242.ch53', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306463407', 'display_name': 'IEEE eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319808', 'host_organization_name': 'Institute of Electrical and Electronics Engineers', 'host_organization_lineage': ['https://openalex.org/P4310319808'], 'host_organization_lineage_names': ['Institute of Electrical and Electronics Engineers'], 'type': 'ebook platform'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'book-chapter', 'type_crossref': 'book-chapter', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [], 'institution_assertions': [], 'countries_distinct_count': 0, 'institutions_distinct_count': 0, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.0, 'has_fulltext': False, 'cited_by_count': 0, 'citation_normalized_percentile': {'value': 0.0, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 0, 'max': 64}, 'biblio': {'volume': None, 'issue': None, 'first_page': None, 'last_page': None}, 'is_retracted': False, 'is_paratext': False, 'primary_topic': {'id': 'https://openalex.org/T12002', 'display_name': 'Computational Complexity and Algorithmic Information Theory', 'score': 0.9899, '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': 'Computational Complexity and Algorithmic Information Theory', 'score': 0.9899, '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': 'Theory and Applications of Cellular Automata', 'score': 0.9791, '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/turing-machine-examples', 'display_name': 'Turing machine examples', 'score': 0.8930381}, {'id': 'https://openalex.org/keywords/non-deterministic-turing-machine', 'display_name': 'Non-deterministic Turing machine', 'score': 0.732128}, {'id': 'https://openalex.org/keywords/probabilistic-turing-machine', 'display_name': 'Probabilistic Turing machine', 'score': 0.70455766}, {'id': 'https://openalex.org/keywords/impossibility', 'display_name': 'Impossibility', 'score': 0.69764835}, {'id': 'https://openalex.org/keywords/nspace', 'display_name': 'NSPACE', 'score': 0.66821754}, {'id': 'https://openalex.org/keywords/description-number', 'display_name': 'Description number', 'score': 0.63945067}, {'id': 'https://openalex.org/keywords/super-recursive-algorithm', 'display_name': 'Super-recursive algorithm', 'score': 0.6025511}, {'id': 'https://openalex.org/keywords/turing', 'display_name': 'Turing', 'score': 0.596687}, {'id': 'https://openalex.org/keywords/turing-machines', 'display_name': 'Turing Machines', 'score': 0.530442}, {'id': 'https://openalex.org/keywords/time-hierarchy-theorem', 'display_name': 'Time hierarchy theorem', 'score': 0.46566272}], 'concepts': [{'id': 'https://openalex.org/C21176728', 'wikidata': 'https://www.wikidata.org/wiki/Q7854963', 'display_name': 'Turing machine examples', 'level': 5, 'score': 0.8930381}, {'id': 'https://openalex.org/C131671149', 'wikidata': 'https://www.wikidata.org/wiki/Q2703890', 'display_name': 'Universal Turing machine', 'level': 4, 'score': 0.8885915}, {'id': 'https://openalex.org/C29248071', 'wikidata': 'https://www.wikidata.org/wiki/Q163310', 'display_name': 'Turing machine', 'level': 3, 'score': 0.84359944}, {'id': 'https://openalex.org/C15190523', 'wikidata': 'https://www.wikidata.org/wiki/Q1190223', 'display_name': 'Non-deterministic Turing machine', 'level': 5, 'score': 0.732128}, {'id': 'https://openalex.org/C144271403', 'wikidata': 'https://www.wikidata.org/wiki/Q1191836', 'display_name': 'Probabilistic Turing machine', 'level': 5, 'score': 0.70455766}, {'id': 'https://openalex.org/C2776261394', 'wikidata': 'https://www.wikidata.org/wiki/Q315562', 'display_name': 'Impossibility', 'level': 2, 'score': 0.69764835}, {'id': 'https://openalex.org/C201958364', 'wikidata': 'https://www.wikidata.org/wiki/Q1756295', 'display_name': 'NSPACE', 'level': 5, 'score': 0.66821754}, {'id': 'https://openalex.org/C179061269', 'wikidata': 'https://www.wikidata.org/wiki/Q5263786', 'display_name': 'Description number', 'level': 5, 'score': 0.63945067}, {'id': 'https://openalex.org/C31402856', 'wikidata': 'https://www.wikidata.org/wiki/Q5295939', 'display_name': 'Super-recursive algorithm', 'level': 5, 'score': 0.6025511}, {'id': 'https://openalex.org/C9870796', 'wikidata': 'https://www.wikidata.org/wiki/Q490481', 'display_name': 'Turing', 'level': 2, 'score': 0.596687}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.50627196}, {'id': 'https://openalex.org/C48415503', 'wikidata': 'https://www.wikidata.org/wiki/Q5251122', 'display_name': 'Time hierarchy theorem', 'level': 5, 'score': 0.46566272}, {'id': 'https://openalex.org/C48103436', 'wikidata': 'https://www.wikidata.org/wiki/Q599031', 'display_name': 'State (computer science)', 'level': 2, 'score': 0.4316064}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.1930233}, {'id': 'https://openalex.org/C199360897', 'wikidata': 'https://www.wikidata.org/wiki/Q9143', 'display_name': 'Programming language', 'level': 1, 'score': 0.079815745}, {'id': 'https://openalex.org/C45374587', 'wikidata': 'https://www.wikidata.org/wiki/Q12525525', 'display_name': 'Computation', 'level': 2, 'score': 0.042120665}, {'id': 'https://openalex.org/C17744445', 'wikidata': 'https://www.wikidata.org/wiki/Q36442', 'display_name': 'Political science', 'level': 0, 'score': 0.0}, {'id': 'https://openalex.org/C199539241', 'wikidata': 'https://www.wikidata.org/wiki/Q7748', 'display_name': 'Law', 'level': 1, 'score': 0.0}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/9780470544242.ch53', 'pdf_url': None, 'source': {'id': 'https://openalex.org/S4306463407', 'display_name': 'IEEE eBooks', 'issn_l': None, 'issn': None, 'is_oa': False, 'is_in_doaj': False, 'is_core': False, 'host_organization': 'https://openalex.org/P4310319808', 'host_organization_name': 'Institute of Electrical and Electronics Engineers', 'host_organization_lineage': ['https://openalex.org/P4310319808'], 'host_organization_lineage_names': ['Institute of Electrical and Electronics Engineers'], 'type': 'ebook platform'}, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 0, 'referenced_works': [], 'related_works': ['https://openalex.org/W3014863312', 'https://openalex.org/W293759077', 'https://openalex.org/W2547364878', 'https://openalex.org/W2348596562', 'https://openalex.org/W2210317531', 'https://openalex.org/W195780958', 'https://openalex.org/W1838451616', 'https://openalex.org/W1760285719', 'https://openalex.org/W1662868588', 'https://openalex.org/W1526857708'], 'abstract_inverted_index': {'<P>This': [0], 'chapter': [1], 'contains': [2], 'sections': [3], 'titled:': [4], '<UL>': [5], '<LI>': [6, 9, 16, 25], '<P>Introduction</P>': [7], '</LI>': [8, 15, 24, 35], '<P>The': [10], 'two-State': [11], 'Universal': [12, 21], 'Turing': [13, 22, 28], 'Machine</P>': [14, 23], '<P>Impossibility': [17], 'of': [18], 'a': [19, 27], 'One-State': [20], '<P>Modeling': [26], 'Machine': [29], 'with': [30], 'Only': [31], 'Two': [32], 'Tape': [33], 'Symbols</P>': [34], '</UL>': [36], '</P>': [37]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2210317531', 'counts_by_year': [], 'updated_date': '2024-09-20T00:23:28.238594', 'created_date': '2016-06-24'}