Published Nov 24, 2017

[MINI] Exponential Time Algorithms

Kyle Polich delves into the world of exponential time algorithms, using generalized chess to highlight the intricacies of verification and strategic decision-making challenges in AI, while unpacking the significance of the EXP-Time complexity class.

Episode Highlights

Topics covered

Popular Clips

Episode Highlights

Related Episodes

[MINI] Markov Chains
Answers 383 questions
[MINI] Is the Internet Secure?
Answers 383 questions
Complexity and Cryptography
Answers 383 questions
Evolutionary Computation
Answers 383 questions
Detecting Cheating in Chess
Answers 383 questions
Auditing Algorithms
Answers 383 questions
[MINI] Big Oh Analysis
Answers 383 questions
[MINI] AdaBoost
Answers 383 questions
[MINI] Turing Machines
Answers 383 questions
The Computational Complexity of Machine Learning
Answers 383 questions
The Master Algorithm
Answers 383 questions
The Model Complexity Myth
Answers 383 questions
The Complexity of Learning Neural Networks
Answers 383 questions
[MINI] The Battle of the Sexes
Answers 383 questions
Game Theory
Answers 383 questions

Dexa/Kyle Polich

[MINI] Exponential Time Algorithms

Topics covered

Popular Clips

Solving Exponential Time

Chess Complexity Explained

Data-Driven Business

Understanding Complexity Classes

Membership Drive Discussion

Donation Call to Action

Strategic Decision Making

Episode Highlights

Solving Exponential Problems

Understanding Complexity Classes

Chess Complexity

Related Episodes

[MINI] Markov Chains

[MINI] Is the Internet Secure?

Complexity and Cryptography

Evolutionary Computation

Detecting Cheating in Chess

Auditing Algorithms

[MINI] Big Oh Analysis

[MINI] AdaBoost

[MINI] Turing Machines

The Computational Complexity of Machine Learning

The Master Algorithm

The Model Complexity Myth

The Complexity of Learning Neural Networks

[MINI] The Battle of the Sexes

Game Theory

[MINI] Exponential Time Algorithms

Topics covered

Popular Clips

Episode Highlights

Solving Exponential Problems

Understanding Complexity ClassesKyle Polich explores the complexity class of EXP-Time, emphasizing its relevance in AI and decision-making. He illustrates the challenges of exponential time algorithms through examples like generalized chess and strategic planning.

Understanding Complexity Classes

Chess ComplexityGeneralized chess serves as a compelling illustration of exponential time complexity, where the vast number of possible moves creates a challenging decision problem. Kyle Polich explores how this complexity impacts the ability to calculate and verify winning strategies efficiently.

Chess Complexity

Related Episodes