Skip to content
You are not logged in |Login  
     
Limit search to available items
Record 11 of 23
Previous Record Next Record
Book Cover
Bestseller
BestsellerE-Book
Author Downey, Allen.

Title Think complexity / Allen B. Downey.

Imprint Needham, Massachusetts : Green Tea Press, 2012-
Publication Info. Minneapolis : Open Textbook Library
©2012-

Copies

Location Call No. Status
 University of Saint Joseph: Pope Pius XII Library - Internet  WORLD WIDE WEB E-BOOK OpenTextbook    Downloadable
Please click here to access this OpenTextbook resource
Description 1 online resource : illustrations.
Current Frequency Updated irregularly.
Description data file rda
Series Green Tea Press : open access computer science e-books
Open textbook library
Open Textbook Library.
Bibliography Includes bibliographical references and index.
Summary "This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science: Data structures and algorithms: A data structure is a collection that contains data elements organized in a way that supports particular operations. For example, a dictionary organizes key-value pairs in a way that provides fast mapping from keys to values, but mapping from values to keys is generally slower. An algorithm is a mechanical process for performing a computation. Designing efficient programs often involves the co-evolution of data structures and the algorithms that use them. For example, the first few chapters are about graphs, a data structure that is a good implementation of a graph---nested dictionaries---and several graph algorithms that use this data structure. Python programming: This book picks up where Think Python leaves off. I assume that you have read that book or have equivalent knowledge of Python. As always, I will try to emphasize fundmental ideas that apply to programming in many languages, but along the way you will learn some useful features that are specific to Python. Computational modeling: A model is a simplified description of a system that is useful for simulation or analysis. Computational models are designed to take advantage of cheap, fast computation. Philosophy of science: The models and results in this book raise a number of questions relevant to the philosophy of science, including the nature of scientific laws, theory choice, realism and instrumentalism, holism and reductionism, and Bayesian epistemology. This 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. They tend to be more abstract than continuous models; in some cases there is no direct correspondence between the model and a physical system. Complexity science is an interdisciplinary field---at the intersection of mathematics, computer science and physics---that focuses on these kinds of models."--Open Textbook Library.
System Details Mode of access: World Wide Web.
Note This bibliographic record is available under the Creative Commons CC0 "No Rights Reserved" license.
Online version, 1.2.3; title from PDF (viewed on July 27, 2016).
Contents 1. Complexity Science -- 2. Graphs -- 3. Analysis of algorithms -- 4. Small world graphs -- 5. Scale-free networks -- 6. Cellular Automata -- 7. Game of Life -- 8. Fractals -- 9. Self-organized criticality -- 10. Agent-based models -- 11. Case study: Sugarscape -- 12. Case study: Ant trails -- 13. Case study: Directed graphs and knots -- Case study: The Volunteer's Dilemma.
Local Note Promoted: Local to Global Cooperative Open Textbook Library
Subject Python (Computer program language)
Computational complexity.
Computational complexity. (OCoLC)fst00871991
Python (Computer program language) (OCoLC)fst01084736
Genre/Form Textbooks (OCoLC)fst01423863
Textbooks.
ISBN 9781449314620
1449314627
-->
Add a Review