ConceptMathematics
Computability
The property that polynomials and their features, such as zeros, can be determined either numerically or symbolically.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
11- Complexity: P, NP, NP-completeness, Reductions
- Reductions
- Introduction to Information Devices and Linear Modeling
- Computational Models: Circuits
- Computational Complexity
- Provably Intractable Problems, Oracles
- Quantum Complexity
- Storage Allocation and Garbage Collection
- HSE Kolmogorov Complexity, Lecture 1: Computability and Solomonoff Induction
- Aesthetics, Mathematics, and Philosophy: Is There an Intersection?
- Mathematics and Metamathematics of Our Physics Project
Connections
18The lectures that define it or assume it, and the concepts next to it.