• Title: Think Complexity: Complexity Science and Computational Modeling, 2nd Edition
• Author(s) Allen B. Downey
• Publisher: O'Reilly Media; 1 edition (2012); 2 edition (2018); eBook (2018, Creative Commons Licensed)
• License(s): CC BY-NC 4.0
• Paperback: 228 pages (est.)
• eBook: HTML and PDF
• Language: English
• ISBN-10: 1449314635
• ISBN-13: 978-1449314637
• Share This:  

Book Description

This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science.

This book presents features that make Python such a simple and powerful language. The author provides code to help you get started, along with a solution for each exercise. With this book, you will:

• Work with graphs and graph algorithms, NumPy arrays and SciPy methods, basic signal processing and Fast Fourier Transform, and hash tables.
• Discover complexity science, the field that studies abstract models of complex physical systems, including power laws, fractals and pink noise, and Turing machines.
• Explore the philosophy of science through the models and results in this book about the nature of scientific laws, theory choice, and realism and instrumentalism, and more.

• Allen B. Downey is an American computer scientist, Professor of Computer Science at the Franklin W. Olin College of Engineering and writer of free textbooks. He has taught computer science at Wellesley College, Colby College and U.C. Berkeley. He has a Ph.D. in Computer Science from U.C. Berkeley and Master's and Bachelor's degrees from MIT.

• Amazon

• Computational Complexity
• Data Structures and Algorithms
• Python Programming
• Books by Allen B. Downey
• Books by O'Reilly®

• Think Complexity: Complexity Science and Computational Modeling, 2nd Edition (Allen Downey)
• The First Edition
• The Mirror Site (1) - PDF, ePub, Kindle, etc.

• Think Data Structures: Algorithms and Information Retrieval

  This practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials. Useful in technical interviews too.

• Problem Solving with Algorithms/Data Structures using Python

  This is a textbook about computer science. It is also about Python. However, there is much more. The tools and techniques that you learn here will be applied over and over as you continue your study of computer science.

• Mathematics and Computation (Avi Wigderson)

  This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

• Algorithms and Complexity (Herbert S. Wilf)

  This is an introductory book on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis.

• Complexity Theory: A Modern Approach (Sanjeev Arora, et al)

  This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation.

• Computability and Complexity: From a Programming Perspective

  This book is an introduction to the basic concepts of computability, complex, and the theory of programming languages. Its goal is to build a bridge between computability and complexity theory and other areas of computer science, especially programming.

• Quantum Computing Since Democritus (Scott Aaronson)

  This book takes readers on a tour through some of the deepest ideas of maths, computer science and physics. Full of insights, arguments and philosophical perspectives, the book covers an amazing array of topics.

• Traveling Salesman Problem, Theory and Applications

  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem, including Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm.

• The Complexity of Boolean Functions (Ingo Wegener)

  Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. It presents a large number of recent research results f Boolean functions previously unavailable in book form.

• Computational Complexity (Wikibooks)

  This book contains material that should be core knowledge in the theory of computation for all graduates in computer science. It starts with classical computability theory which forms the basis for complexity theory.

• Computational Complexity: A Conceptual Perspective (Goldreich)

  This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study.