Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Turing Machines: Recursive Languages
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Deterministic Pushdown Automata
Covers deterministic pushdown automata and their use in language recognition.
Untitled
Halting Problem: Unsolvable Problems
Explores the halting problem, demonstrating its unsolvability and the limitations of algorithms.
Theory of Computability and Halting Problem
Covers the theory of computability and the halting problem in algorithms.
Information Measures: Entropy and Information Theory
Explains how entropy measures uncertainty in a system based on possible outcomes.
LED, Light and Color
Covers the energy and radiation of LEDs, transitions in energy levels, and color synthesis.
Exponential Family: Definition and Properties
Covers the Exponential Family, including its definition, sufficient statistics, and distribution properties.
Theoretical Properties of RNNs
Explores the theoretical properties and practical power of Recurrent Neural Networks, including their relationship to state machines and Turing completeness.
Context-Free Grammars
Covers context-free grammars, their equivalence to pushdown automata, and the hierarchy of grammar types.
Interlacing Families and Ramanujan Graphs
Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.
