{"id":"https://openalex.org/W2034004280","doi":"https://doi.org/10.1142/s0129054192000115","title":"ON THE COMPUTING POWER OF PROGRAMS WITH SETS","display_name":"ON THE COMPUTING POWER OF PROGRAMS WITH SETS","publication_year":1992,"publication_date":"1992-06-01","ids":{"openalex":"https://openalex.org/W2034004280","doi":"https://doi.org/10.1142/s0129054192000115","mag":"2034004280"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054192000115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054192000115","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/A5037776590","display_name":"Alexei P. Stolboushkin","orcid":null},"institutions":[{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]},{"id":"https://openalex.org/I3131595280","display_name":"University of Pereslavl","ror":"https://ror.org/042r33k66","country_code":"RU","type":"education","lineage":["https://openalex.org/I3131595280"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"ALEXEI P. STOLBOUSHKIN","raw_affiliation_strings":["AI Research Center, Program Systems Institute, Russian Academy of Sciences, Russia","Mailing address: 6 Polevaja Str., Apt. 40, Pereslavl-Zalessky 152140, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AI Research Center, Program Systems Institute, Russian Academy of Sciences, Russia","institution_ids":["https://openalex.org/I1313323035"]},{"raw_affiliation_string":"Mailing address: 6 Polevaja Str., Apt. 40, Pereslavl-Zalessky 152140, Russia","institution_ids":["https://openalex.org/I3131595280"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037776590"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I3131595280"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17108115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"03","issue":"02","first_page":"161","last_page":"180"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.949999988079071,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9110999703407288,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7799099087715149},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.6680175065994263},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.6465033292770386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5995203852653503},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5911062955856323},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5458905100822449},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.51567542552948},{"id":"https://openalex.org/keywords/halting-problem","display_name":"Halting problem","score":0.5139366984367371},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5014545917510986},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.46666544675827026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3499203324317932},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33925381302833557},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2978561520576477},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2196924090385437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19666749238967896}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7799099087715149},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.6680175065994263},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.6465033292770386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5995203852653503},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5911062955856323},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5458905100822449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.51567542552948},{"id":"https://openalex.org/C137343475","wikidata":"https://www.wikidata.org/wiki/Q622849","display_name":"Halting problem","level":4,"score":0.5139366984367371},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5014545917510986},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.46666544675827026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3499203324317932},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33925381302833557},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2978561520576477},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2196924090385437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19666749238967896},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054192000115","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054192000115","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":0,"referenced_works":[],"related_works":["https://openalex.org/W98540345","https://openalex.org/W2962921822","https://openalex.org/W4361868354","https://openalex.org/W3082414006","https://openalex.org/W2952990452","https://openalex.org/W1516047453","https://openalex.org/W2103947741","https://openalex.org/W2256315455","https://openalex.org/W4289670448","https://openalex.org/W2889033124"],"abstract_inverted_index":{"The":[0],"class":[1,27,50,77,82,89,119],"FDSet":[2,78,120],"of":[3,18,65,75,90,95,102],"while-programs":[4],"equipped":[5],"with":[6],"finite":[7,55,93],"sets":[8],"as":[9],"internal":[10],"data":[11,103],"type":[12],"is":[13,28,57,69,121],"considered":[14],"in":[15,42,108,111],"the":[16,51,63,72,76,81,88,109,116],"context":[17],"generalized":[19,127],"computability":[20],"over":[21],"abstract":[22],"first":[23],"order":[24],"structures.":[25],"This":[26],"proved":[29,70],"to":[30,34,37,115],"be":[31,35],"semi-universal,":[32],"i.e.":[33],"able":[36],"compute":[38],"every":[39,43],"computable":[40,84],"function":[41],"infinite":[44],"finitely-generated":[45],"structure.":[46],"However,":[47],"for":[48,125],"this":[49,118],"halting":[52],"problem":[53],"on":[54,87],"structures":[56,94],"decidable":[58],"within":[59],"LinearSpace":[60,83],"complexity":[61,104,128],"(on":[62],"cardinality":[64],"structure),":[66],"and":[67],"it":[68],"that":[71],"dynamic":[73],"logic":[74],"describes":[79],"exactly":[80],"global":[85],"predicates":[86],"all":[91],"one-generated":[92],"a":[96,122],"given":[97],"signature.":[98],"Some":[99],"other":[100],"classes":[101],"are":[105],"also":[106],"described":[107],"paper":[110],"similar":[112],"terms.":[113],"Due":[114],"semi-universality,":[117],"good":[123],"basis":[124],"developing":[126],"theory.":[129]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}