Great Ideas in Theoretical Computer Science: Deductive Systems
Explore deductive systems in theoretical computer science, covering topics like Hilbert's 10th problem, binary trees, propositional logic, and logical equivalence.
Fast Learning of Small Strategies - Jan Křetínský, Technical University of Munich
Discover fast learning techniques for small strategies in Markov decision processes, combining verification precision with machine learning scalability for ε-optimal strategies and concise representation.
Alan Turing and the Other Theory of Computing and Can a Machine Be Conscious?
Explore neuroscience advances in understanding consciousness, including the Global Workspace Model and its computational implications, with insights on free will and determinism.
Can Machines Think Like Humans? - Dr Mateja Jamnik
Explore the fascinating question of machine cognition and its comparison to human thought processes in this engaging seminar by Dr Mateja Jamnik from the Alan Turing Institute.
Challenges with Running fstests and blktests
Explore challenges in file system stability testing, including determinism, baselines, and lessons learned for improving test reliability and system performance.
Will Humans Merge with Machines - The Future of Human-Machine Interaction
Explore the future of human-machine interaction, discussing societal transformation, ethical implications, and potential breakthroughs in governance as technology rapidly advances.
Incremental View Maintenance- Beyond Worst-Case Analysis II
Explore advanced techniques in incremental view maintenance, focusing on fine-grained complexity analysis and its applications in logic and query evaluation.
Incremental View Maintenance: Beyond Worst-Case Analysis I
Explore advanced techniques in incremental view maintenance, focusing on fine-grained complexity analysis and its applications in logic and query evaluation.
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.
Optimizing Relational Programs I
Explore fine-grained complexity, logic, and query evaluation techniques for optimizing relational programs in database systems and computational theory.
Massively Parallel Evaluation of Relational Queries II
Explore advanced techniques for parallel processing of relational database queries, focusing on fine-grained complexity and efficient evaluation strategies.
Massively Parallel Evaluation of Relational Queries I
Explore advanced techniques for parallel processing of relational database queries, focusing on fine-grained complexity and efficient evaluation strategies.
CPU Power Saving Methods for Real-time Workloads
Explore CPU power-saving techniques for real-time workloads, balancing energy efficiency and latency requirements. Learn tools and methods to optimize performance without compromising deterministic behavior.
Approximating the TV Distance Between Two Product Distributions
Explore techniques for approximating total variation distance between high-dimensional product distributions, including randomized coupling and deterministic sparsification methods.
Marginal Determinism in Structured Decomposable Circuits
Explores marginal determinism in probabilistic circuits, introducing md-vtrees for structured decomposable PCs. Discusses tractability conditions, efficient algorithms, and applications to causal inference queries like backdoor adjustment.
The Rise of Tractable Circuits - From Cryptography to Continuous Generative Models
Exploring tractable circuits' applications in cryptography and continuous generative models, showcasing advancements in neuro-symbolic approaches and probabilistic inference for AI reasoning.
Combined Approximations for Probabilistic Query Evaluation - An Intensional Approach
Explore innovative techniques for probabilistic query evaluation using combined approximations, focusing on an intensional approach to enhance efficiency and accuracy.
First-Order Model Counting and Sampling
Explores recent developments in weighted first-order model counting and sampling, discussing applications in combinatorics, probability theory, and potential for declarative frameworks in sampling combinatorial structures.
Model Counting Meets Distinct Estimation
Exploring connections between model counting and F0 estimation, revealing shared techniques and developing new algorithms for both fields through cross-domain insights.
Connecting Human and Artificial Intelligence - From AI to Cosmic Consciousness
Explore the journey from AI to Cosmic Consciousness with Arun Tiwari. Discover the interconnectedness of human intelligence and cosmic order, and gain insights on living a purposeful life through imagination, purity, and faith.
The Problem with Human Specialness in the Age of AI
Scott Aaronson challenges human exceptionalism in the AI era, exploring implications for intelligence, creativity, and our relationship with technology. He invites a reevaluation of narratives shaping our future.