{"id":"https://openalex.org/W1580526823","doi":"https://doi.org/10.1007/11786986_13","title":"P-completeness of Cellular Automaton Rule 110","display_name":"P-completeness of Cellular Automaton Rule 110","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1580526823","doi":"https://doi.org/10.1007/11786986_13","mag":"1580526823"},"language":"en","primary_location":{"id":"doi:10.1007/11786986_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11786986_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5009737906","display_name":"Turlough Neary","orcid":"https://orcid.org/0000-0003-1042-6630"},"institutions":[{"id":"https://openalex.org/I157286207","display_name":"National University of Ireland, Maynooth","ror":"https://ror.org/048nfjm95","country_code":"IE","type":"education","lineage":["https://openalex.org/I157286207"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Turlough Neary","raw_affiliation_strings":["TASS, Department of Computer Science, National University of Ireland Maynooth, Ireland"],"affiliations":[{"raw_affiliation_string":"TASS, Department of Computer Science, National University of Ireland Maynooth, Ireland","institution_ids":["https://openalex.org/I157286207"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029275026","display_name":"Damien Woods","orcid":"https://orcid.org/0000-0002-0638-2690"},"institutions":[{"id":"https://openalex.org/I27577105","display_name":"University College Cork","ror":"https://ror.org/03265fv13","country_code":"IE","type":"education","lineage":["https://openalex.org/I27577105"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Damien Woods","raw_affiliation_strings":["Department of Mathematics and Boole Centre for Research in Informatics, University College Cork, Ireland"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Boole Centre for Research in Informatics, University College Cork, Ireland","institution_ids":["https://openalex.org/I27577105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009737906"],"corresponding_institution_ids":["https://openalex.org/I157286207"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":9.5804,"has_fulltext":false,"cited_by_count":126,"citation_normalized_percentile":{"value":0.987714,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9950000047683716,"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/T12029","display_name":"DNA and Biological Computing","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7464951872825623},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.72793048620224},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.6134787797927856},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5974363088607788},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5973067283630371},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5830786228179932},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.5622297525405884},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.500525951385498},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.49791574478149414},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4620605707168579},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4588087797164917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4171043038368225},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41650134325027466},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.4103717803955078},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36181893944740295},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26049160957336426},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.21413016319274902},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15802276134490967},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.12027382850646973}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7464951872825623},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.72793048620224},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.6134787797927856},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5974363088607788},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5973067283630371},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5830786228179932},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.5622297525405884},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.500525951385498},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.49791574478149414},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4620605707168579},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4588087797164917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4171043038368225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41650134325027466},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.4103717803955078},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36181893944740295},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26049160957336426},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.21413016319274902},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15802276134490967},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.12027382850646973},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11786986_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11786986_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W421997344","https://openalex.org/W1244836833","https://openalex.org/W1497287285","https://openalex.org/W1513287292","https://openalex.org/W1573866315","https://openalex.org/W1662868588","https://openalex.org/W1753985450","https://openalex.org/W1815178522","https://openalex.org/W2002089154","https://openalex.org/W2019196333","https://openalex.org/W2026161213","https://openalex.org/W2036424138","https://openalex.org/W2053756189","https://openalex.org/W2062687967","https://openalex.org/W2065105492","https://openalex.org/W2081142955","https://openalex.org/W2089837601","https://openalex.org/W2586782524","https://openalex.org/W2620826411","https://openalex.org/W3104172864","https://openalex.org/W3136855764","https://openalex.org/W3157585079","https://openalex.org/W4230463006","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2341138125","https://openalex.org/W2037124586","https://openalex.org/W2156308118","https://openalex.org/W1969470083","https://openalex.org/W4312201671","https://openalex.org/W4254404873","https://openalex.org/W192442233","https://openalex.org/W2273345230","https://openalex.org/W2963860960","https://openalex.org/W2053429109"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}