Logo

Think Complexity: Complexity Science and Computational Modeling

Large book cover: Think Complexity: Complexity Science and Computational Modeling

Think Complexity: Complexity Science and Computational Modeling
by

Publisher: Green Tea Press
ISBN/ASIN: 1449314635
Number of pages: 146

Description:
This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. The book focuses on discrete models, which include graphs, cellular automata, and agent-based models. They are often characterized by structure, rules and transitions rather than by equations.

Home page url

Download or read it online for free here:
Download link
(1.2MB, PDF)

Similar books

Book cover: Complexity TheoryComplexity Theory
by
This set of notes gives the broad picture of modern complexity theory, defines the basic complexity classes, gives some examples of each complexity class and proves the most standard relations. The author emphasizes the ideas involved in the proofs.
(11811 views)
Book cover: Introduction to Computational ComplexityIntroduction to Computational Complexity
by
Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.
(6074 views)
Book cover: Complexity and ComputationComplexity and Computation
by - Green Tea Press
This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science. The book covers Graphs, Analysis of algorithms, Scale-free networks, Cellular Automata, Agent-based models, etc.
(11599 views)
Book cover: Foundations of CryptographyFoundations of Cryptography
by - Cambridge University Press
The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.
(11579 views)