| 期刊全稱 | Boolean Functions and Computation Models | | 影響因子2023 | Peter Clote,Evangelos Kranakis | | 視頻video | http://file.papertrans.cn/190/189780/189780.mp4 | | 發(fā)行地址 | A survey of the present state of the art by internationally well-known authors.Focus on "fast" parallel computation.Includes numerous exercises ranging in difficulty.Includes supplementary material: | | 學(xué)科分類 | Texts in Theoretical Computer Science. An EATCS Series | | 圖書(shū)封面 |  | | 影響因子 | The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu- ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a "computation step" , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa- tion? In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as | | Pindex | Textbook 2002 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-18 18:08
發(fā)表于 2025-3-21 16:58:36
