Pub Date : 2022-04-19DOI: 10.48550/arXiv.2204.08740
K. Apt, Sunil Simon
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the players have complete knowledge of the previously made moves. Almost all discussed results are well-known, but often they are not presented in an optimal form. Also, they usually appear in the literature aimed at economists or mathematicians, so the algorithmic or logical aspects are underrepresented.
{"title":"A tutorial for computer scientists on finite extensive games with perfect information","authors":"K. Apt, Sunil Simon","doi":"10.48550/arXiv.2204.08740","DOIUrl":"https://doi.org/10.48550/arXiv.2204.08740","url":null,"abstract":"We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the players have complete knowledge of the previously made moves. Almost all discussed results are well-known, but often they are not presented in an optimal form. Also, they usually appear in the literature aimed at economists or mathematicians, so the algorithmic or logical aspects are underrepresented.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134481883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-01-31DOI: 10.13130/PRIGIONIERO-LUCA_PHD2020-01-31
Luca Prigioniero
It is well known that regular (or Type 3) languages are equivalent to finite automata. Nevertheless, many other characterizations of this class of lan- guages in terms of computational devices and generative models are present in the literature. For example, by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only. These restricted formalisms provide alternative representations of Type 3 languages that may be significantly more concise than other models that share the same express- ing power. The goal of this work is to provide an overview of old and recent re- sults on these formal systems from a descriptional complexity perspective, that is the study of the relationships between the sizes of such devices. We also present some results related to the investigation of the famous ques- tion posed by Sakoda and Sipser in 1978, concerning the size blowups from nondeterministic finite automata to two-way deterministic finite automata.
{"title":"Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations","authors":"Luca Prigioniero","doi":"10.13130/PRIGIONIERO-LUCA_PHD2020-01-31","DOIUrl":"https://doi.org/10.13130/PRIGIONIERO-LUCA_PHD2020-01-31","url":null,"abstract":"It is well known that regular (or Type 3) languages are equivalent to finite automata. Nevertheless, many other characterizations of this class of lan- guages in terms of computational devices and generative models are present in the literature. For example, by suitably restricting more general models such as context-free grammars, pushdown automata, and Turing machines, that characterize wider classes of languages, it is possible to obtain formal models that generate or recognize regular languages only. These restricted formalisms provide alternative representations of Type 3 languages that may be significantly more concise than other models that share the same express- ing power. The goal of this work is to provide an overview of old and recent re- sults on these formal systems from a descriptional complexity perspective, that is the study of the relationships between the sizes of such devices. We also present some results related to the investigation of the famous ques- tion posed by Sakoda and Sipser in 1978, concerning the size blowups from nondeterministic finite automata to two-way deterministic finite automata.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128011751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In mathematical applications, category theory remains a contentious issue, with enthusiastic fans and a skeptical majority. In a muted form this split applies to the authors of this note. When we learned that the only mathematically sound foundation of topological quantum computing in the literature is based on category theory, the skeptical author suggested to "decategorize" the foundation. But we discovered, to our surprise, that category theory (or something like it) is necessary for the purpose, for computational reasons. The goal of this note is to give a high-level explanation of that necessity, which avoids details and which suggests that the case of topological quantum computing is far from unique.
{"title":"Who needs category theory?","authors":"A. Blass, Y. Gurevich","doi":"10.29007/4dr3","DOIUrl":"https://doi.org/10.29007/4dr3","url":null,"abstract":"In mathematical applications, category theory remains a contentious issue, with enthusiastic fans and a skeptical majority. In a muted form this split applies to the authors of this note. When we learned that the only mathematically sound foundation of topological quantum computing in the literature is based on category theory, the skeptical author suggested to \"decategorize\" the foundation. But we discovered, to our surprise, that category theory (or something like it) is necessary for the purpose, for computational reasons. The goal of this note is to give a high-level explanation of that necessity, which avoids details and which suggests that the case of topological quantum computing is far from unique.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115045214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-06-20DOI: 10.4995/thesis/10251/68506
David Insa, Josep Silva
Nowadays, undetected programming bugs produce a waste of billions of dollars per year to private and public companies and institutions. In spite of this, no significant advances in the debugging area that help developers along the software development process have been achieved yet. In fact, the same debugging techniques that were used 20 years ago are still being used now. Although some alternatives have appeared, they are still a long way until they become useful enough to be part of the software development process. One of such alternatives is Algorithmic Debugging, which abstracts the information the user has to investigate to debug the program, allowing them to focus on what, rather than how, is happening. This abstraction comes at a price: the granularity level of the bugs that can be detected allows for isolating wrongly implemented functions, but which part of them contains the bug cannot be found out yet. This work is a short introduction of some published papers that focus on improving Algorithmic Debugging in many aspects. Concretely, the main aims of these papers are to reduce the time the user needs to detect a programming bug as well as to provide the user with more detailed information about where the bug is located.
{"title":"Optimization Techniques for Algorithmic Debugging","authors":"David Insa, Josep Silva","doi":"10.4995/thesis/10251/68506","DOIUrl":"https://doi.org/10.4995/thesis/10251/68506","url":null,"abstract":"Nowadays, undetected programming bugs produce a waste of billions of dollars per year to private and public companies and institutions. In spite of this, no significant advances in the debugging area that help developers along the software development process have been achieved yet. In fact, the same debugging techniques that were used 20 years ago are still being used now. Although some alternatives have appeared, they are still a long way until they become useful enough to be part of the software development process. One of such alternatives is Algorithmic Debugging, which abstracts the information the user has to investigate to debug the program, allowing them to focus on what, rather than how, is happening. This abstraction comes at a price: the granularity level of the bugs that can be detected allows for isolating wrongly implemented functions, but which part of them contains the bug cannot be found out yet. This work is a short introduction of some published papers that focus on improving Algorithmic Debugging in many aspects. Concretely, the main aims of these papers are to reduce the time the user needs to detect a programming bug as well as to provide the user with more detailed information about where the bug is located.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Why the memoir? Well, the author of the scheduled article became unwell. (He should be up and running soon, and his article will appear at some later time.) Facing the prospect of missing an issue, I thought about what I can do in a few days before the deadline. It occurred to me that 2016 is the 50th anniversary of the 1966 International Congress of Mathematicians. Maybe the impressions of a young Soviet mathematician would be of interest to at least some of the readers.
{"title":"The 1966 International Congress of Mathematicians: A micro-memoir","authors":"Y. Gurevich","doi":"10.3233/fi-222122","DOIUrl":"https://doi.org/10.3233/fi-222122","url":null,"abstract":"Why the memoir? Well, the author of the scheduled article became unwell. (He should be up and running soon, and his article will appear at some later time.) Facing the prospect of missing an issue, I thought about what I can do in a few days before the deadline. It occurred to me that 2016 is the 50th anniversary of the 1966 International Congress of Mathematicians. Maybe the impressions of a young Soviet mathematician would be of interest to at least some of the readers.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115525708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-08-30DOI: 10.1017/cbo9781316779309
T. Roughgarden, K. Iwama
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.
{"title":"Twenty Lectures on Algorithmic Game Theory","authors":"T. Roughgarden, K. Iwama","doi":"10.1017/cbo9781316779309","DOIUrl":"https://doi.org/10.1017/cbo9781316779309","url":null,"abstract":"Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125172702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life
书的介绍:算法的力量，灵感和日常生活中的例子
{"title":"Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life","authors":"G. Ausiello, R. Petreschi","doi":"10.5860/choice.51-5648","DOIUrl":"https://doi.org/10.5860/choice.51-5648","url":null,"abstract":"Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：