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

£31.83

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

Name: Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
Brand: Springer
Price: 31.83 GBP
Availability: InStock

19 black & white illustrations, 19 black

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£32 today · usual range £0–£0 · best ever £22

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 598 days • 598 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 598 days • 4 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £22-25 (230 days, 38.5%)

Price range: £22 - £36

Price levels: 4 price ranges over 598 days

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. 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 the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines.

Key Features

New

Mint Condition

Dispatch same day for order received before 12 noon

Guaranteed packaging

No quibbles returns

Product Specifications

Brand: Springer
Model: 19 black & white illustrations, 19 black
Format: hardcover
ASIN: 3540594361
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 19 September 2002
Listed Since: 01 February 2007

Barcode

No barcode data available

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

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

What Can Be Computed? – A Practical Guide to the Theory of Computation

Mathematical Foundations of Computer Science

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

A Programming Approach to Computability (Monographs in Computer Science)

Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)

The Nature of Computation

Formal Languages, Automata and Numeration Systems 2: Applications to Recognizability and Decidability (Iste)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Theory of Computation (Texts in Computer Science)

Computability and Complexity

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

The Foundations of Computability Theory

New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings: 3526 (Lecture Notes in Computer Science, 3526)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Theory of Computation

Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998: 1450 (Lecture Notes in Computer Science, 1450)

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Rudiments of Calculus (Volume 146) (Studies in Logic and the Foundations of Mathematics, Volume 146)

From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology: 335 (Studies in Computational Intelligence, 335)

Computational Complexity: A Modern Approach