We can't find the internet
Attempting to reconnect
Something went wrong!
Hang in there while we get back on track
£31.83
Springer Boolean Functions and Computation Models (Texts in Theoretical Computer Science. An EATCS Series)
19 black & white illustrations, 19 black
Price data last checked 88 day(s) ago - refreshing...
Price History & Forecast
Last 3 days • 3 data points (No recent data available)
Price Distribution
Price distribution over 3 days • 2 price levels
Current Price
Price Analysis
Most common price: £32 (2 days, 66.7%)
Price range: £32 - £32
Price levels: 2 different prices over 3 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
- 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
Similar Products You Might Like
93% match
The Foundations of Computability Theory
Springer
£45.90
15 Feb 2026
93% match
Theory of Computation: Automata, Formal Languages, Computation and Complexity
Springer
£84.49
15 Feb 2026
93% match
A Programming Approach to Computability (Monographs in Computer Science)
Springer
£52.53
08 Mar 2026
93% match
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
£46.10
25 Feb 2026
93% match
Theory of Computation (Texts in Computer Science)
Springer
£63.52
07 Jan 2026
93% match
Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)
Springer
£154.95
13 Jan 2026
93% match
Theory of Computation
Wiley
£84.57
09 Mar 2026
93% match
Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
£131.82
05 Feb 2026
93% match
Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)
Springer
£143.36
25 Jan 2026
93% match
From Boolean Logic to Switching Circuits and Automata: Towards Modern Information Technology: 335 (Studies in Computational Intelligence, 335)
Springer
£128.30
13 Apr 2026
93% match
Algebraic Complexity Theory: 315 (Grundlehren der mathematischen Wissenschaften, 315)
Springer
£101.05
23 Jan 2026
93% match
Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)
£23.91
17 Dec 2025
92% match
Language Computability and Formal Language Theory
Society Publishing
£86.14
08 Mar 2026
92% match
Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)
Chapman and Hall/CRC
£85.97
23 Jan 2026
92% match
Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)
Springer
£78.16
05 Feb 2026
92% match
What Can Be Computed? – A Practical Guide to the Theory of Computation
Princeton University Press
£39.35
25 Jan 2026
92% match
Computation Engineering: Applied Automata Theory and Logic
Springer
£68.10
23 Feb 2026
92% match
Computability
Springer
£47.73
20 Feb 2026
92% match
Understanding Computation: Pillars, Paradigms, Principles (Texts in Computer Science)
Springer
£51.75
06 Feb 2026
92% match
Complexity and Real Computation
Springer
£48.45
06 Mar 2026
92% match
Demystifying Computation: A Hands-on Introduction
Scientific Publishing
£48.66
22 Feb 2026
92% match
Advances in Unconventional Computing: Volume 1: Theory: 22 (Emergence, Complexity and Computation, 22)
Springer
£142.76
10 Mar 2026
92% match
Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)
Springer
£77.03
28 Feb 2026
92% match
Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures
Springer
£47.73
19 Feb 2026