YoVDO

Tutorial on Computer Science - Josh Grochow

Offered By: Santa Fe Institute via YouTube

Tags

Computer Science Courses Computational Complexity Theory Courses

Course Description

Overview

Explore the foundations and key concepts of computer science in this 55-minute tutorial led by Josh Grochow from the Santa Fe Institute. Delve into topics such as model independence, natural language, computational complexity theory, and the P vs NP problem. Examine various models of computation, including uniform and non-uniform models, constant depth circuits, finite machines, petri nets, and grammars. Gain insights into information processing, computation, and meta-questions in the field. Discover the breadth of computer science and its intersections with other disciplines while learning about important areas not covered in the tutorial.

Syllabus

Introduction
Computer science canon
Model independence
Natural language
Computational complexity theory
Meta question
Is it discrete
Is it computation
Information processing
Computation
Models of Computation
Uniform Models
NonUniform Models
Constant Depth Circuit
Finite Machines
Petronets
Grammars
P vs NP
What we didnt cover


Taught by

Santa Fe Institute

Tags

Related Courses

理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX
The Introduction to Quantum Computing
Saint Petersburg State University via Coursera
Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam
Computational Complexity
IIT Hyderabad via Swayam