New formal methods based on game semantics and their descriptive hierarchy
| Project/Area Number |
26540001
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
|
|---|
| Research Collaborator |
NEMOTO Takako
HORIHATA Yoshihiro
KASHIMA Ryo
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | ゲーム意味論 / 高次計算論 / ゲーム木 / プッシュダウン・オートマトン / 数理論理学 |
|---|
| Outline of Final Research Achievements |
In this research, we have invented several new formal methods based on game semantics in order to analyze the complication of multi-dimensional multi-agent systems, which cannot be captured by ordinary computability theory. Among others, we investigated the determinacy strength of infinite games recognized by various pushdown automata, and pinned them down in terms of higher recursion theory. We also got some new results on the query complexity of game trees with random inputs.
|
Report
(4 results)
Research Products
(18 results)
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 決定問題の相転移2015
Author(s)
田中一之
Organizer
情報処理学会第７７回全国大会
Place of Presentation
京都大学
Year and Date
2015-03-17
Related Report
Invited
-
-
-
-
-
-
-
