Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)

  • ただいまウェブストアではご注文を受け付けておりません。 ⇒古書を探す
  • 製本 Paperback:紙装版/ペーパーバック版
  • 商品コード 9783642082177

Full Description

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. In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that .

最近チェックした商品