Science Track Lecture Notes

Chapters	Lecture Title & Author
General	Historical Ideas of Formal Uncertainty, and NKS Irreducibility, Jason Cawley Writing Efficent Mathematica Code, Seth J. Chandler NKS Research Tools: CellularAutomaton, Richard Phillips NKS Workshop, Øyvind Tafjord Patterns in Mathematica, Paul-Jean Letourneau What Is A New Kind of Science?, Matthew Frank
Chapter 2	Basic Notions of NKS, Eric Rowland The Basic Experiment, Vitaliy Kaurov
Chapter 3	Turing Machines, Matthew Szudzik The Analysis of a Turing Machine, Matthew Szudzik The TuringMachine Function, Hector Zenil Conducting Searches, Paul-Jean Letourneau The CellularAutomaton Function, Vitaliy Kaurov Polynomial Forms of Cellular Automaton Rules, Vitaliy Kaurov
Chapter 4	Systems Based on Real Numbers, Matthew Frank Systems Based on Numbers, Ed Pegg Jr.
Chapter 5	Famous 2D CA Rules, Ed Pegg Jr.
Chapter 6	Identification of Cyclic Behavior, Ed Pegg Jr. Randomness and Continuity, Øyvind Tafjord Randomness, Hector Zenil
Chapter 7	Modeling Natural Behavior, Ed Pegg Jr.
Chapter 8	NKS in the Social Sciences, Jason Cawley Monte Carlo Methods, Etienne Bernard
Chapter 9	Fundamental Physics and NKS, Øyvind Tafjord NKS and Physics, Øyvind Tafjord
Chapter 10	Perception and Analysis, Matthew Frank Perception, Peter Barendse Statistical Methods, Paul-Jean Letourneau Data in Mathematica, Carlo Barbieri
Chapter 11	The Analysis of an S-K Combinator Expression, Matthew Szudzik A Survey of "Other" Rule Systems, Matthew Szudzik Emulation and Irreducibility, Matthew Szudzik The Enumeration of Computational Systems, Matthew Szudzik Logic and the Foundations of Mathematics, Matthew Szudzik
Chapter 12	Computational Equivalence and Computational Irreducibility, Matthew Frank Philosophical Implications, Jason Cawley Principle of Computational Equivalence, Todd Rowland
Notes
p. 957	Finite Automata and Automatic Sequences, Eric Rowland
p. 1100	Natural Language Models, Etienne Bernard