Главная
Study mode:
on
1
Introduction
2
Mathematical Theorems
3
Theorems vs Problems
4
Shorthand
5
Oracle Approach
6
Computability
7
The Halting Problem
8
The Tree Theorem
9
Whats a Tree
10
Is it computable
11
Building the tree
12
Using the halting problem
13
Prime Ideal Theorem
14
Algorithmic Handing
15
Oracle Example
16
The foundational crisis of mathematics
17
What is reverse mathematics
18
The Big Five
19
Proof
20
Conclusion
21
Questions
Description:
Explore the intricacies of mathematical problem-solving and computational complexity in this 56-minute AMS-MAA Invited Address delivered by Karen Lange from Wellesley College at the Joint Mathematics Meetings 2020 in Denver, CO. Delve into the fascinating world of "Different Problems, Common Threads" as Lange examines the difficulty of computing mathematical problems. Journey through key concepts such as mathematical theorems, computability, the Halting Problem, and the Tree Theorem. Investigate the Prime Ideal Theorem and its algorithmic handling, and gain insights into the foundational crisis of mathematics and reverse mathematics. Conclude with a thought-provoking exploration of "The Big Five" and engage in a stimulating Q&A session.

Different Problems, Common Threads - Computing the Difficulty of Mathematical Problems

Joint Mathematics Meetings
Add to list