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 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.
(15479 views)
Book cover: P, NP, and NP-Completeness: The Basics of Complexity TheoryP, NP, and NP-Completeness: The Basics of Complexity Theory
by - Cambridge University Press
The main focus of the current book is on the P-vs-NP Question and the theory of NP-completeness. Additional topics that are covered include the treatment of the general notion of a reduction between computational problems.
(9188 views)
Book cover: Mathematics and ComputationMathematics and Computation
by - Princeton University Press
The book provides a broad, conceptual overview of computational complexity theory -- the mathematical study of efficient computation. It is useful for undergraduate and graduate students in mathematics, computer science, and related fields.
(3172 views)
Book cover: Around Kolmogorov Complexity: Basic Notions and ResultsAround Kolmogorov Complexity: Basic Notions and Results
by - arXiv.org
Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.
(6244 views)