{"id":"https://openalex.org/W3080288488","doi":"https://doi.org/10.1145/3407982.3407993","title":"Declarative and Imperative Approaches for Proving Turing Completeness of SPIDER","display_name":"Declarative and Imperative Approaches for Proving Turing Completeness of SPIDER","publication_year":2020,"publication_date":"2020-06-19","ids":{"openalex":"https://openalex.org/W3080288488","doi":"https://doi.org/10.1145/3407982.3407993","mag":"3080288488"},"language":"en","primary_location":{"id":"doi:10.1145/3407982.3407993","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3407982.3407993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st International Conference on Computer Systems and Technologies","raw_type":"proceedings-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/A5007368579","display_name":"Emilia Golemanova","orcid":null},"institutions":[{"id":"https://openalex.org/I43986944","display_name":"Angel Kanchev University of Ruse","ror":"https://ror.org/01g09ef73","country_code":"BG","type":"education","lineage":["https://openalex.org/I43986944"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Emilia Golemanova","raw_affiliation_strings":["Computer Systems and Technologies, Ruse University, Ruse Bulgaria"],"affiliations":[{"raw_affiliation_string":"Computer Systems and Technologies, Ruse University, Ruse Bulgaria","institution_ids":["https://openalex.org/I43986944"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043727161","display_name":"Tzanko Golemanov","orcid":null},"institutions":[{"id":"https://openalex.org/I43986944","display_name":"Angel Kanchev University of Ruse","ror":"https://ror.org/01g09ef73","country_code":"BG","type":"education","lineage":["https://openalex.org/I43986944"]}],"countries":["BG"],"is_corresponding":false,"raw_author_name":"Tzanko Golemanov","raw_affiliation_strings":["Computer Systems and Technologies, Ruse University, Ruse Bulgaria"],"affiliations":[{"raw_affiliation_string":"Computer Systems and Technologies, Ruse University, Ruse Bulgaria","institution_ids":["https://openalex.org/I43986944"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007368579"],"corresponding_institution_ids":["https://openalex.org/I43986944"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12506294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"94","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9861999750137329,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9642000198364258,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.7914825677871704},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6680189371109009},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6572879552841187},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.6324703693389893},{"id":"https://openalex.org/keywords/super-recursive-algorithm","display_name":"Super-recursive algorithm","score":0.5597100853919983},{"id":"https://openalex.org/keywords/description-number","display_name":"Description number","score":0.5517734885215759},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5106838345527649},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.49495452642440796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4780210256576538},{"id":"https://openalex.org/keywords/turing-machine-examples","display_name":"Turing machine examples","score":0.4407534599304199},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.4396597146987915},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.43085652589797974},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.4051905870437622},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.29324930906295776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14142608642578125},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.07640278339385986}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7914825677871704},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6680189371109009},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6572879552841187},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.6324703693389893},{"id":"https://openalex.org/C31402856","wikidata":"https://www.wikidata.org/wiki/Q5295939","display_name":"Super-recursive algorithm","level":5,"score":0.5597100853919983},{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.5517734885215759},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5106838345527649},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.49495452642440796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4780210256576538},{"id":"https://openalex.org/C21176728","wikidata":"https://www.wikidata.org/wiki/Q7854963","display_name":"Turing machine examples","level":5,"score":0.4407534599304199},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.4396597146987915},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.43085652589797974},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.4051905870437622},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.29324930906295776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14142608642578125},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.07640278339385986},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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.1145/3407982.3407993","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3407982.3407993","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st International Conference on Computer Systems and Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W166194785","https://openalex.org/W187407644","https://openalex.org/W191974930","https://openalex.org/W1593486735","https://openalex.org/W1900357389","https://openalex.org/W1975283720","https://openalex.org/W1980284195","https://openalex.org/W2021822669","https://openalex.org/W2052277516","https://openalex.org/W2126160338","https://openalex.org/W2159813417","https://openalex.org/W2334129451","https://openalex.org/W2415491409","https://openalex.org/W2973308213","https://openalex.org/W3204266626","https://openalex.org/W4239453361","https://openalex.org/W4299495396"],"related_works":["https://openalex.org/W3014863312","https://openalex.org/W293759077","https://openalex.org/W195780958","https://openalex.org/W1662868588","https://openalex.org/W2547364878","https://openalex.org/W1526857708","https://openalex.org/W2348596562","https://openalex.org/W2119421720","https://openalex.org/W2556768775","https://openalex.org/W68480898"],"abstract_inverted_index":{"Control":[0],"Network":[1],"Programming,":[2],"or":[3],"just":[4],"CNP,":[5],"and":[6,23,71,92],"its":[7],"supporting":[8],"language":[9],"named":[10],"SPIDER,":[11],"is":[12,29,47,50,85],"a":[13,30,60,86,89],"new":[14],"programming":[15],"paradigm":[16],"combining":[17],"features":[18,94],"from":[19],"the":[20,35,38,41,64,76],"declarative,":[21],"imperative":[22,72],"graphical":[24],"programming.":[25],"A":[26],"Turing":[27,48,65,77,83],"machine":[28,78],"theoretical":[31],"abstraction":[32],"that":[33,46,82],"expresses":[34],"extent":[36],"of":[37,40,63,67,75,88],"power":[39],"computational":[42],"models.":[43],"Any":[44],"system":[45],"complete":[49],"sufficiently":[51],"powerful":[52],"to":[53,96],"compute":[54],"any":[55],"algorithm.":[56],"The":[57],"paper":[58],"provides":[59],"simple":[61],"proof":[62],"completeness":[66,84],"SPIDER":[68],"by":[69],"declarative":[70],"CNP":[73],"implementations":[74],"behavior,":[79],"thereby":[80],"showing":[81],"consequence":[87],"few":[90],"basic":[91],"fundamental":[93],"inherent":[95],"SPIDER.":[97]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}