000			03638nam a2200349 4500
001			OTLid0000289
003			MnU
005			20201105133314.0
006			m o d s
008			180907s2012 mnu o 0 0 eng d
020			_a9781449314637
040			_aMnU _beng _cMnU
050		4	_aQA76
100	1		_aDowney, Allen B. _eauthor
245	0	0	_aThink Complexity _bExploring Complexity Science with Python _cAllen Downey
264		2	_bOpen Textbook Library
264		1	_bGreen Tea Press
300			_a1 online resource
490	0		_aOpen textbook library.
505	0		_aPreface -- 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 -- 14 Case study: The Volunteer's Dilemma
520	0		_aThis 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. That's what this book is about.
542	1		_fAttribution-NonCommercial-ShareAlike
546			_aIn English.
588	0		_aDescription based on online resource
650		0	_aComputer Science _vTextbooks
710	2		_aOpen Textbook Library _edistributor
856	4	0	_uhttps://open.umn.edu/opentextbooks/textbooks/289 _zAccess online version
999			_c19689 _d19689