Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Theory of Computation: Problems Definition and Counting (Denumerability)
Graph Chatbot
Related lectures (37)
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Theory of Computation: Undecidable Problems
Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.
Theory of Computation: Counting and Decision Problems
Explores counting infinite sets and decision problems, showcasing the limits of computation in solving certain undecidable problems.
Relations, Sequences and Summations
Covers strings, countable sets, cardinality, and the concept of countability, exploring the countability of various sets and Cantor diagonalization.
Finite Systems Expressed with Formulas
Explores finite transition systems, propositional logic, truth interpretation, satisfiability, and boolean function representation with circuits.
Recursive Enumerability: Turing Machines and Undecidable Languages
Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Numbers and Booleans
Introduces numbers and booleans in Python, covering numeric types, arithmetic operations, logical operations, and comparisons.
Finite Systems Expressed with Formulas
Explores encoding finite systems with boolean functions, propositional logic, inductive invariants, and formal proof systems.
Cardinality of Sets: Countable and Uncountable
Explores cardinality, countable sets, and examples of countable and uncountable sets.
Nonlinear Dynamics: Chaos and Complex Systems
Explores countable and uncountable sets, Cantor set, Mandelbrot set, and Box dimension in nonlinear dynamics and complex systems.
Elementary Algebra: Numeric Sets
Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.
Theory of Computation: Countability and Undecidable Problems
Log in to Mediaspace to watch this video
Explores countability and undecidable problems in the theory of computation.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
Quantum Circuits: Classic Circuits
Log in to Mediaspace to watch this video
Explores classic circuits in quantum computing, including Boolean functions and reversible gates.
Boolean Hidden Matching Problem
Log in to Mediaspace to watch this video
Explores the Boolean Hidden Matching Problem, focusing on distinguishing messages with negligible probability.
Deutsch and Josza Problem
Log in to Mediaspace to watch this video
Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.
Computation & Algorithms I
Log in to Mediaspace to watch this video
Covers the basics of algorithms, their historical significance, pseudo-code representation, and practical tasks in computational thinking.
Closure Conversion: Representation and Transformation
Log in to Mediaspace to watch this video
Explores the representation and transformation of values, focusing on closure conversion and the challenges of representing functions in functional languages.
Graph Matching Entropy
Log in to Mediaspace to watch this video
Explores the relationship between matchings, entropy, and Bethe free entropy in random graphs.
Previous
Page 1 of 2
Next
