Sizes of Cohen-type forcing condition : Application to randomness and computational complexity
| Project/Area Number |
17540131
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Tokyo Metropolitan University (2006-2007)
Osaka Prefecture University (2005) |
|---|
Principal Investigator |
SUZUKI Toshio Tokyo Metropolitan University, Department of Mathematics and Information Sciences, Associate professor (30235973)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KUMABE Masahiro The Open University of Japan, Faculty of Liberal Arts, Associate professor (70255173)
|
|---|
| Project Period (FY) |
2005 – 2007
|
| Project Status |
Completed (Fiscal Year 2007)
|
| Budget Amount *help |
¥3,370,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2006: ¥1,100,000 (Direct Cost: ¥1,100,000)
Fiscal Year 2005: ¥1,100,000 (Direct Cost: ¥1,100,000)
|
|---|
| Keywords | mathematical logic / foundation of computer sciences / algorithm / randomness / random number |
|---|
| Research Abstract |
We improve the main theorem of the following paper. Toshio Suzuki, Archive for Mathematical Logic, vcol.44 (2005) pp. 751-762. The constant norm in the main theorem of the above paper is relaxed to multiple of constant and the norm. Summary of this result may be found in the following research report. M. Kumabe, T Suzuki and T. Yamazaki, "Truth-table reductions and minimum sizes of forcing conditions", Surikaisekikenkyusho-kokyuroku, vol. 1533 (2007), Research Institute of Mathematical Sciences, Kyoto University.
We study Boolean functions defined by copies of a Boolean decision tree connected in parallel. An input string is given to leaves, and an output string is given by roots. We investigate which kind of weak randomness property is conserved by this type of Boolean functions. We showed a necessary condition of Martin-Loef randomness is conserved by this type of Boolean functions. The necessary condition is that for every positive integer r, a give oracle is r-generic in the sense of Dowd. We report this result at the following conference talk. "Which weak-randomness property is preserved by Boolean decision trees?", Proof theory 2007 (2007 December 3-4), Tokyo Metropolitan-University.
|
Report
(4 results)
Research Products
(30 results)
