講演抄録/キーワード |
講演名 |
2012-06-21 11:25
Recursive and non recursive formulas in finitism ○Eiichi Tanaka(Kobe Univ.) COMP2012-16 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
This report shows that the diagonalization in the set of all finite length unary functions (formulas) produces a non-finite length function (formula) under a strict finitism. This fact gives a chance to review several established theories such as the first incompleteness theorem, the diagonal theorem, a typical proof of the halting problem of a Turing machine, and so on. A finitism without the concept of infinity does not cover the Gödel’s world. |
キーワード |
(和) |
/ / / / / / / |
(英) |
The first incompleteness theorem / Recursive function theory / Finitism / Diagonalization / Halting problem / / / |
文献情報 |
信学技報, vol. 112, no. 93, COMP2012-16, pp. 33-40, 2012年6月. |
資料番号 |
COMP2012-16 |
発行日 |
2012-06-14 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2012-16 |