Get Free Shipping on orders over $89
Texts in Theoretical Computer Science. an Eatcs : Texts in Theoretical Computer Science. an Eatcs Series - Peter Clote

Texts in Theoretical Computer Science. an Eatcs

By: Peter Clote, Evangelos Kranakis

Paperback | 21 October 2010

At a Glance

Paperback


$129.75

or 4 interest-free payments of $32.44 with

 or 

Ships in 5 to 7 business days

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.
Industry Reviews

From the reviews:

"The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. ... the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers." (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)

Other Editions and Formats

Hardcover

Published: 19th September 2002

More in Mathematical Foundation

Oxford Maths for Australian Schools Year 3 Value Pack : 3rd Edition - Annie Facchinetti
Oxford Maths for Australian Schools Year 4 Value Pack : 3rd Edition - Annie Facchinetti
Oxford Maths for Australian Schools Year 6 Value Pack : 3rd Edition - Brian Murray
Oxford Maths for Australian Schools Year 2 Value Pack : 3rd Edition - Annie Facchinetti
Oxford Maths for Australian Schools Value Pack Year 5 : Oxford Maths - Brian Murray
Huge Numbers : A Story of Counting Ambitiously - Richard Elwes
Oxford Maths for Australian Schools Year 1 Value Pack : 3rd Edition - Annie Facchinetti
Handbook of Automated Reasoning - Rachel Phillips
Current Trends in Automated Reasoning - Erika Bach
Foundation Maths : 7th Edition - Anthony Croft

RRP $140.65

$124.75

11%
OFF
Oxford Maths for Australian Schools Year F Value Pack : 3rd Edition - Annie Facchinetti
Teaching Secondary Mathematics : 2nd Edition - Bing H.  Ngu

RRP $80.95

$66.99

17%
OFF
Teaching Mathematics 3e & Open Ended Maths Activities Revised Ed Value Pack - Dianne Siemon
Unequal : The Maths of When Things Do and Don't Add Up - Eugenia Cheng