Lectures related to Computability theory

Sciences and Technologies Studies: Commensurable Data

Discusses the transition from case studies to commensurable data in Sciences and Technologies Studies, emphasizing comparisons and indicators.

Foundations of Deep Learning: Transformer Architecture Overview

Covers the foundational concepts of deep learning and the Transformer architecture, focusing on neural networks, attention mechanisms, and their applications in sequence modeling tasks.

Communication Amid Uncertainty

Explores challenges in human communication, context importance, compression problems, uncertain functionality, and proof verification.

Universal Turing Machine: Definition and Functioning

Explores the universal Turing machine, its canonical representation, and its role in defining algorithms and theoretical computer science concepts.

Theory of Computability and Halting Problem

Covers the theory of computability and the halting problem in algorithms.

Numerical Analysis: Implicit Schemes

Covers implicit schemes in numerical analysis for solving partial differential equations.

Nerves and Geometric Realization

Covers the explicit computations of nerves of categories and geometric realisations of simplicial sets.

Theory of Computability: Solvability and Complexity

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Recursive Functions: Substitution Interpreter

Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.

Voronoi Analysis: Closest Vector Problem

Explores Voronoi analysis for efficient Closest Vector Problem solutions.

Kirillov Paradigm for Heisenberg Group

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

Recursive Enumerability: Turing Machines and Undecidable Languages

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

Graph Sketching: Connected Components

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

Trust region methods: framework & algorithms

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

Numerics: semester project

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

Quasi-newton optimization

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

Finite Difference Grids

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

Deutsch-Jozsa Algorithm

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

Random Coding: Achievability and Proof Variants

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

Excitonic Devices: Modeling and Applications

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