Mathematical Foundations of Computer Science - Image 1

£41.39

Chapman and Hall/CRC Mathematical Foundations of Computer Science

Name: Mathematical Foundations of Computer Science
Brand: Chapman and Hall/CRC
Price: 41.39 GBP
Availability: InStock

Algorithms

Same price for 22 weeks. Today is much like next week.

£41 for 156 days straight · last change was Aug 2025

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 457 days • 457 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 457 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £41 (307 days, 67.2%)

Price range: £39 - £42

Price levels: 3 different prices over 457 days

Description

Mathematical Foundations of Computer Science introduces students to the discrete mathematics needed later in their Computer Science coursework with theory of computation topics interleaved throughout. Students learn about mathematical concepts just in time to apply them to theory of computation ideas. For instance, sets motivate the study of finite automata, direct proof is practised using closure properties, induction is used to prove the language of an automaton, and contradiction is used to apply the pumping lemma. The main content of the book starts with primitive data types such as sets and strings and ends with showing the undecidability of the halting problem. There are also appendix chapters on combinatorics, probability, elementary number theory, asymptotic notation, graphs, loop invariants, and recurrences. The content is laid out concisely with a heavy reliance on worked examples, of which there are over 250 in the book. Each chapter has exercises, totalling 550. This class-tested textbook is targeted to intermediate Computer Science majors, and it is primarily intended for a discrete math / proofs course in a Computer Science major. It is also suitable for introductory theory of computation courses. The authors hope this book breeds curiosity into the subject and is designed to satisfy this to some extent by reading this book. The book will prepare readers for deeper study of game theory applications in many fields of study.

Product Specifications

Brand: Chapman and Hall/CRC
Format: paperback
ASIN: 1032467878
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 05 November 2024
Listed Since: 14 May 2024

Barcode

No barcode data available

Chapman and Hall/CRC Mathematical Foundations of Computer Science

Same price for 22 weeks. Today is much like next week.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Essential Discrete Mathematics for Computer Science

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

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)

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

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

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

Automata, Logics, and Infinite Games: A Guide to Current Research: 2500 (Lecture Notes in Computer Science, 2500)

Automata, Languages and Programming: 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II: 5556 (Lecture Notes in Computer Science, 5556)

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)

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

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

Automata, Universality, Computation: Tribute to Maurice Margenstern: 12 (Emergence, Complexity and Computation, 12)

The Discrete Math Workbook: A Companion Manual Using Python (Texts in Computer Science)

The Discrete Mathematical Charms of Paul Erdos: A Simple Introduction

Automata and Computability

Programming-Based Formal Languages and Automata Theory: Design, Implement, Validate, and Prove (Texts in Computer Science)

Sequences, Groups, and Number Theory (Trends in Mathematics)

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)

Mathematics for Computer Science

Automata and Computability (Undergraduate Texts in Computer Science)

Problems and Exercises in Discrete Mathematics: 14 (Texts in the Mathematical Sciences, 14)

A Tale Of Discrete Mathematics: A Journey Through Logic, Reasoning, Structures And Graph Theory