{"id":"https://openalex.org/W2011276709","doi":"https://doi.org/10.1142/s0129054114400152","title":"DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES","display_name":"DESCRIPTIONAL COMPLEXITY IN ENCODED BLUM STATIC COMPLEXITY SPACES","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2011276709","doi":"https://doi.org/10.1142/s0129054114400152","mag":"2011276709"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054114400152","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400152","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5021282163","display_name":"Cezar C\u00e2mpeanu","orcid":"https://orcid.org/0000-0002-9777-3012"},"institutions":[{"id":"https://openalex.org/I22188714","display_name":"University of Prince Edward Island","ror":"https://ror.org/02xh9x144","country_code":"CA","type":"education","lineage":["https://openalex.org/I22188714"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"CEZAR C\u00c2MPEANU","raw_affiliation_strings":["Department of Computer Science and Information Technology, The University of Prince Edward Island, Charlottetown, Prince Edward Island C1A4P3, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, The University of Prince Edward Island, Charlottetown, Prince Edward Island C1A4P3, Canada","institution_ids":["https://openalex.org/I22188714"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021282163"],"corresponding_institution_ids":["https://openalex.org/I22188714"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08465486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"07","first_page":"917","last_page":"932"},"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/T11567","display_name":"semigroups and automata theory","score":0.9932000041007996,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9825000166893005,"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/axiom","display_name":"Axiom","score":0.6103119254112244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5711371898651123},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.5447848439216614},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5210144519805908},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.5153881311416626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4144079089164734},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.389407753944397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3571343421936035},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2784819006919861},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.07545527815818787},{"id":"https://openalex.org/keywords/quantum-information","display_name":"Quantum information","score":0.06669744849205017}],"concepts":[{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6103119254112244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5711371898651123},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.5447848439216614},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5210144519805908},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.5153881311416626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4144079089164734},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.389407753944397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3571343421936035},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2784819006919861},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.07545527815818787},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.06669744849205017},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054114400152","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054114400152","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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":16,"referenced_works":["https://openalex.org/W150741891","https://openalex.org/W1529663204","https://openalex.org/W1968738492","https://openalex.org/W1997448562","https://openalex.org/W2007412164","https://openalex.org/W2020311636","https://openalex.org/W2063199724","https://openalex.org/W2063930126","https://openalex.org/W2071530339","https://openalex.org/W2085538865","https://openalex.org/W2106875872","https://openalex.org/W2149211673","https://openalex.org/W2331953749","https://openalex.org/W2401183865","https://openalex.org/W2613017511","https://openalex.org/W2786516640"],"related_works":["https://openalex.org/W1988772559","https://openalex.org/W2565115296","https://openalex.org/W1834737061","https://openalex.org/W2964237202","https://openalex.org/W2029183607","https://openalex.org/W3094951835","https://openalex.org/W2327776271","https://openalex.org/W2555446247","https://openalex.org/W2374430960","https://openalex.org/W2055638573"],"abstract_inverted_index":{"Algorithmic":[0],"Information":[1],"Theory":[2],"is":[3],"based":[4],"on":[5],"the":[6,17,41,50,62,68,73,94,107,120],"notion":[7],"of":[8,21,40,52,64,70,75,97,109,114,122],"descriptional":[9,53,65,98,110],"complexity":[10,42,66,113],"known":[11],"as":[12],"Chaitin-Kolmogorov":[13],"complexity,":[14,111],"defined":[15,29,37,118],"in":[16,19,46,77],"'60s":[18],"terms":[20],"minimal":[22,79],"description":[23],"length.":[24],"Blum":[25,31,124,131],"Static":[26,125,132],"Complexity":[27,126,133],"spaces":[28,36,134],"using":[30,38],"axioms,":[32],"and":[33,86,135],"Encoded":[34,123,136],"Function":[35,137],"properties":[39],"function,":[43],"were":[44],"introduced":[45],"2012":[47],"to":[48,93],"generalize":[49],"concept":[51,63],"complexity.":[54,99],"In":[55,100],"formal":[56],"language":[57],"theory":[58],"we":[59,103],"also":[60],"use":[61],"for":[67],"number":[69,74,89],"states,":[71],"or":[72],"transitions":[76],"a":[78,83],"finite":[80],"automaton":[81],"accepting":[82],"regular":[84],"language,":[85],"apparently,":[87],"this":[88,101],"has":[90],"no":[91],"connection":[92],"general":[95],"case":[96],"paper":[102],"prove":[104],"that":[105],"all":[106],"definitions":[108],"including":[112],"operations,":[115],"can":[116],"be":[117],"within":[119],"framework":[121],"spaces,":[127],"which":[128],"extend":[129],"both":[130],"spaces.":[138]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}