{"id":"https://openalex.org/W1499037316","doi":"https://doi.org/10.1007/978-0-387-34735-6_6","title":"Recursion and Probability","display_name":"Recursion and Probability","publication_year":2006,"publication_date":"2006-12-14","ids":{"openalex":"https://openalex.org/W1499037316","doi":"https://doi.org/10.1007/978-0-387-34735-6_6","mag":"1499037316"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-34735-6_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-34735-6_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-34735-6_6.pdf","source":null,"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":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-34735-6_6.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Department of Computer Science, Columbia University, 455 Computer Science Building, 1214 Amsterdam Avenue, Mail Code 0401 New York, NY 10027","Columbia University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University, 455 Computer Science Building, 1214 Amsterdam Avenue, Mail Code 0401 New York, NY 10027","institution_ids":[]},{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043084405"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06691754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"13","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919999837875366,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919999837875366,"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.9797000288963318,"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.9610000252723694,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8403737545013428},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7112941741943359},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6438440084457397},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5912621021270752},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5394945740699768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5334439873695374},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4909546673297882},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.42970582842826843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.395124614238739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3727812170982361},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26367032527923584},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16026169061660767},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1155754029750824}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8403737545013428},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7112941741943359},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6438440084457397},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5912621021270752},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5394945740699768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5334439873695374},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4909546673297882},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.42970582842826843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.395124614238739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3727812170982361},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26367032527923584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16026169061660767},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1155754029750824},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-0-387-34735-6_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-34735-6_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-34735-6_6.pdf","source":null,"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"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-34735-6_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-34735-6_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-34735-6_6.pdf","source":null,"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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.75}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1499037316.pdf","grobid_xml":"https://content.openalex.org/works/W1499037316.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2997055691","https://openalex.org/W2315999538","https://openalex.org/W187740018","https://openalex.org/W2162286586","https://openalex.org/W4255368532","https://openalex.org/W3126873283","https://openalex.org/W2540690809","https://openalex.org/W4376457996","https://openalex.org/W2393621008","https://openalex.org/W4317465184"],"abstract_inverted_index":{"We":[0],"discuss":[1],"recent":[2,98],"work":[3],"on":[4],"the":[5,24,124,137],"algorithmic":[6,114],"analysis":[7,122],"of":[8,42,97,104,118,123,126,136],"systems":[9,87],"involving":[10,88],"recursion":[11],"and":[12,47,58,66,77,80,91,111,121,140],"probability.":[13],"Recursive":[14,62,67],"Markov":[15,21,29,63,74],"chains":[16,22,30],"extend":[17,71],"ordinary":[18,72],"finite":[19,73],"state":[20],"with":[23,45,100],"ability":[25],"to":[26],"invoke":[27],"other":[28,49],"in":[31],"a":[32,38,95],"potentially":[33],"recursive":[34,86],"manner.":[35],"They":[36],"offer":[37],"natural":[39,83],"abstract":[40],"model":[41],"probabilistic":[43,90],"programs":[44],"procedures,":[46],"generalize":[48],"classical":[50],"well-studied":[51],"stochastic":[52,78],"models,":[53],"eg.":[54],"Multi-type":[55],"Branching":[56],"Processes":[57,65],"Stochastic":[59,68],"Context-free":[60],"Grammars.":[61],"Decision":[64],"Games":[69],"similarly":[70],"decision":[75],"processes":[76],"games,":[79],"they":[81],"are":[82],"models":[84,110],"for":[85],"both":[89],"nonprobabilistic":[92],"actions.":[93],"In":[94,129],"series":[96],"papers":[99],"Kousha":[101],"Etessami":[102],"(U.":[103],"Edinburgh),":[105],"we":[106,132],"have":[107],"introduced":[108],"these":[109],"studied":[112],"central":[113],"problems":[115],"regarding":[116],"questions":[117],"termination,":[119],"reachability,":[120],"properties":[125],"their":[127],"executions.":[128],"this":[130],"talk":[131],"will":[133],"present":[134],"some":[135],"basic":[138],"theory":[139],"algorithms.":[141]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}