Computability theory

Related lectures (25)

Page 2 of 3

Explores the Kirillov paradigm for the Heisenberg group and unitary representations.

Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.

Covers the concept of graph sketching with a focus on connected components.

Covers trust region methods, focusing on the framework and algorithms.

Covers the semester project on numerics, focusing on adaptive algorithms and multistep methods.

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.

Explains finite difference grids for computing solutions of elastic membranes using Laplace's equation and numerical methods.

Covers the Deutsch-Jozsa algorithm, determining if a function is constant or balanced with a single query.

Explores random coding achievability and proof variants in information theory, emphasizing achievable rates and architectural principles.

Covers excitonic device modeling and exciton control using 2D materials.