Theory of computation

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (30)

Pickands' Dependence Function

Explores Pickands' dependence function, concurrence probability, and angular density functions.

Picking Factor Computation

Covers the computation of the picking factor and related exercises.

Graph Matching Entropy

Explores the relationship between matchings, entropy, and Bethe free entropy in random graphs.

Turing Machines: Recursive Languages

Explores Turing machines, recursive languages, and decidability in the theory of computation.

Noncommutative Smith Form

Covers the computation of the Smith Form for noncommutative systems.

Replica Symmetry Breaking: Full Solution & Condensation

Explores Replica Symmetry Breaking in the Random Energy Model, discussing configurational entropy and condensation.

Formal Definition of Turing Machines

Explores the theoretical definition of computation and introduces Turing machines.

Quantum and Nanocomputing: Atomic Quantum Dot based Quantum Cellular Automata

Explores the revolutionary approach to computation enabled by single silicon atoms acting as 'quantum dots'.

Computation & Algorithms I

Covers the basics of algorithms, their historical significance, pseudo-code representation, and practical tasks in computational thinking.

Fokker Planck Equation: Transition Probability and SDE

Explores the Fokker Planck equation, transition probability, and SDE properties.

Scripts and Algorithms: MATLAB and Octave Basics

Introduces the basics of scripts and algorithms using MATLAB and Octave for beginners.

Manopt: Optimization on Manifolds

Introduces Manopt, a toolbox for optimization on manifolds, covering gradient and Hessian checks, solver calls, and manual caching.

Introduction to Information, Computation, and Communication

Introduces the fundamental principles of Information, Computation, and Communication theory, covering genomics, medical imaging, and assistive technology.

Girvan-Newman Algorithm

Introduces the Girvan-Newman Algorithm for network decomposition based on edge betweenness and demonstrates its application in physics collaborations.

Haptics: Exploring Touch in Human-Machine Interfaces

Explores the significance of touch in modern interfaces and the challenges of flat displays.

Undecidability: Recursive Languages and Turing Machines

Explores undecidability through recursive languages, Turing machines, and the halting problem.

Montgomery Multiplication

Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.

Discrete Log Problem: Pollard's Rho Method

Introduces Pollard's rho method for the discrete log problem and finding collisions efficiently in a cyclic group.

Decay Rate & Dyson Series

Explores cross section, decay rate, and Dyson series in turbulence, emphasizing proper split and Lorentz invariance.

Turing Machine Example: Testing for Even Numbers

Demonstrates a Turing machine testing for even numbers using binary input.

Page 1 of 2