Effective Theories for Computational Systems - Lecture 2
Offered By: Santa Fe Institute via YouTube
Course Description
Overview
Explore the concept of effective theories for computational systems in this lecture from the Santa Fe Institute's 2012 Complex Systems Summer School. Delve into topics such as aggregation, finite state machines, regular languages, and modeling problems. Examine the principles of groups, pure resets, and aggregate rules while considering the aggregation of agents and history models. Investigate the phenomenon of emergence and gain a comprehensive understanding of how these concepts interrelate in complex systems. Benefit from the interdisciplinary approach tailored for graduate and postdoctoral students in mathematical, biological, cognitive, and social sciences.
Syllabus
Intro
Aggregation
Finite State Machines
Regular Languages
Modeling Problem
Groups
Pure Resets
Example
Aggregation of Agents
Aggregate Rule
History Models
Emergence
Recap
Taught by
Santa Fe Institute
Tags
Related Courses
Automata TheoryStanford University via edX Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Theory of Computation
NPTEL via YouTube Deterministic Finite Automata
Ryan O'Donnell via YouTube Great Ideas in Theoretical Computer Science: Finite Automata
Ryan O'Donnell via YouTube