Computation in Complex Systems
Offered By: Santa Fe Institute via Complexity Explorer
Course Description
Overview
This course explores computational complexity, from search algorithms and solution landscapes to reductions and universality. We explore problems ranging from easy (polynomial time) to hard (NP-complete) to impossible (undecidable). These ideas form one of the most beautiful fields of modern mathematics, and they are increasingly relevant to sciences ranging from physics to biology. The aim of this course is to help participants gain an understanding of the deep ideas of theoretical computer science in a clear and enjoyable fashion, making those ideas accessible both to non-computer scientists and to computer scientists who want to revisit these ideas in a broader and deeper way.
Syllabus
- Easy and Hard
- Algorithms and Landscapes
- P versus NP
- Worst-case, Natural, and Random
- Computation Everywhere
Taught by
Cristopher Moore
Tags
Related Courses
Design and Analysis of AlgorithmsChennai Mathematical Institute via Swayam How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Artificial Intelligence
Georgia Institute of Technology via Udacity Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera Introducción a la programación en Java: empezando a programar
Universidad Carlos iii de Madrid via edX