{"id":"https://openalex.org/W1559028969","doi":"https://doi.org/10.1007/1-4020-8141-3_36","title":"Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies","display_name":"Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W1559028969","doi":"https://doi.org/10.1007/1-4020-8141-3_36","mag":"1559028969"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_36","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","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/A5013318700","display_name":"Chung-Chih Li","orcid":null},"institutions":[{"id":"https://openalex.org/I177898655","display_name":"Lamar University","ror":"https://ror.org/008ms5s18","country_code":"US","type":"education","lineage":["https://openalex.org/I177898655"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chung-Chih Li","raw_affiliation_strings":["Computer Science Department, Lamar University Beaumont, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Lamar University Beaumont, Texas, USA","institution_ids":["https://openalex.org/I177898655"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013318700"],"corresponding_institution_ids":["https://openalex.org/I177898655"],"apc_list":null,"apc_paid":null,"fwci":0.8331,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71742195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"465","last_page":"478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9979000091552734,"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.993399977684021,"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/mathematics","display_name":"Mathematics","score":0.6890993118286133},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.6338372826576233},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5983415246009827},{"id":"https://openalex.org/keywords/baire-space","display_name":"Baire space","score":0.5454864501953125},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5338868498802185},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5103780627250671},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49416759610176086},{"id":"https://openalex.org/keywords/baire-category-theorem","display_name":"Baire category theorem","score":0.49085503816604614},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.47740164399147034},{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.4737706482410431},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.43755078315734863},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4355798363685608},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.417594313621521},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3453596830368042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27093830704689026},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.26978302001953125},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.23903784155845642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2029249668121338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18433064222335815}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6890993118286133},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.6338372826576233},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5983415246009827},{"id":"https://openalex.org/C166359235","wikidata":"https://www.wikidata.org/wiki/Q1150180","display_name":"Baire space","level":2,"score":0.5454864501953125},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5338868498802185},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5103780627250671},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49416759610176086},{"id":"https://openalex.org/C44659138","wikidata":"https://www.wikidata.org/wiki/Q1052678","display_name":"Baire category theorem","level":2,"score":0.49085503816604614},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.47740164399147034},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.4737706482410431},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.43755078315734863},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4355798363685608},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.417594313621521},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3453596830368042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27093830704689026},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26978302001953125},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.23903784155845642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2029249668121338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18433064222335815},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/1-4020-8141-3_36","is_oa":false,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_36","pdf_url":null,"source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.92.9344","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.9344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itk.ilstu.edu/faculty/chungli/mypapers/T2AsyTCS04_CR.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W168951100","https://openalex.org/W194534466","https://openalex.org/W623765668","https://openalex.org/W634402487","https://openalex.org/W1551612278","https://openalex.org/W1965442792","https://openalex.org/W1967821414","https://openalex.org/W2015666295","https://openalex.org/W2019040320","https://openalex.org/W2021141490","https://openalex.org/W2038586290","https://openalex.org/W2043382625","https://openalex.org/W2079301183","https://openalex.org/W2081635977","https://openalex.org/W2089442854","https://openalex.org/W2091585331","https://openalex.org/W2103196242","https://openalex.org/W2117832390","https://openalex.org/W2125495920","https://openalex.org/W2166160002","https://openalex.org/W2339497338","https://openalex.org/W2530006810","https://openalex.org/W2797656628","https://openalex.org/W4229636845","https://openalex.org/W4251222677","https://openalex.org/W6675928244"],"related_works":["https://openalex.org/W2374361304","https://openalex.org/W2995769104","https://openalex.org/W4249557005","https://openalex.org/W2293919302","https://openalex.org/W2025164011","https://openalex.org/W2589397755","https://openalex.org/W1528076845","https://openalex.org/W2412485260","https://openalex.org/W3184575261","https://openalex.org/W2951560735"],"abstract_inverted_index":{"We":[0,91,108,133],"propose":[1],"an":[2,69],"alternative":[3,70],"notion":[4,19,34,78,127],"of":[5,11,35,65,88,113,128,155],"asymptotic":[6,18,130],"behaviors":[7],"for":[8,43,50,72],"the":[9,16,33,54,147,153,156],"study":[10],"type-2":[12,29,44,51,80,111,129,151],"computational":[13],"complexity.":[14],"Since":[15],"classical":[17,157],"(for":[20],"all":[21],"but":[22],"finitely":[23],"many)":[24],"is":[25,53,131],"not":[26],"acceptable":[27],"in":[28,86,145],"context,":[30],"we":[31,59],"alter":[32],"\u201csmall":[36],"sets\u201d":[37],"from":[38],"\u201cfiniteness\u201d":[39],"to":[40,122,141],"topological":[41],"\u201ccompactness\u201d":[42],"complexity":[45,81,95,102,148,158],"theory.":[46,159],"A":[47],"natural":[48],"reference":[49],"computations":[52],"standard":[55],"Baire":[56],"topology.":[57],"However,":[58],"point":[60],"out":[61],"some":[62],"serious":[63],"drawbacks":[64],"this":[66],"and":[67,119],"introduce":[68],"topology":[71],"describing":[73],"compact":[74],"sets.":[75],"Following":[76],"our":[77,126,136],"explicit":[79],"classes":[82,96],"can":[83],"be":[84],"defined":[85],"terms":[87],"resource":[89],"bounds.":[90],"show":[92],"that":[93,125,135],"such":[94],"are":[97],"recursively":[98],"representable;":[99],"namely,":[100],"every":[101],"class":[103],"has":[104],"a":[105,142],"programming":[106],"system.":[107],"also":[109],"prove":[110],"analogs":[112],"Rabin\u2019s":[114],"Theorem,":[115,118],"Recursive":[116],"Relatedness":[117],"Gap":[120],"Theorem":[121],"provide":[123],"evidence":[124],"workable.":[132],"speculate":[134],"investigation":[137],"will":[138],"give":[139],"rise":[140],"possible":[143],"approach":[144],"examining":[146],"structure":[149],"at":[150],"along":[152],"line":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}