| 書目名稱 | Feasible Mathematics II | | 編輯 | Peter Clote,Jeffrey B. Remmel | | 視頻video | http://file.papertrans.cn/342/341553/341553.mp4 | | 叢書名稱 | Progress in Computer Science and Applied Logic | | 圖書封面 |  | | 描述 | Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don‘t know ‘what is supposed to come out‘ . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa- tion device, such as a ‘lUring machine or boolean circuit. Feasible math- ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa- rameters of the problem are the cause of i | | 出版日期 | Conference proceedings 1995 | | 關鍵詞 | algebra; combinatorics; complexity; logic; mathematics | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-2566-9 | | isbn_softcover | 978-1-4612-7582-4 | | isbn_ebook | 978-1-4612-2566-9Series ISSN 2297-0576 Series E-ISSN 2297-0584 | | issn_series | 2297-0576 | | copyright | Birkh?user Boston 1995 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2025-10-12 22:11
發(fā)表于 2025-3-21 19:32:24
