The Expressiveness of Recognizability by Orbite Finite Nominal Monoids

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=OV4vn5GkvSM


Duration: 31:15
110 views
2

Thomas Colcombet, IRIF
https://simons.berkeley.edu/talks/thomas-colcombet-11-10-2016
{Symmetry, Logic, Computation}



Other Videos By Simons Institute for the Theory of Computing


2016-11-15Timing Matters: Online Dynamics in Broadcast Games
2016-11-15Distribution-Specific Analysis of Nearest Neighbor Search and Classification
2016-11-15Spectral Approaches to Nearest Neighbor Search
2016-11-14Applied Mixed Integer Programming: Beyond 'The Optimum'
2016-11-14Analyzing Algorithms on Real World Data
2016-11-14On the Effect of Randomness on Planted 3-Coloring Models
2016-11-14Clustering Under Perturbation Resilience
2016-11-14Learning Probabilistic Models for Graph Partitioning in the Presence of Noise
2016-11-14A Brief Intro to Analysis Beyond the Worst Case
2016-11-10Testing Assignments to Constraint Satisfaction Problems
2016-11-10The Expressiveness of Recognizability by Orbite Finite Nominal Monoids
2016-11-10Logics of Finite Hankel Rank
2016-11-10Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
2016-11-10Symmetry-Preserving Finite Synthesis and Amalgamation
2016-11-10Logic in Computer Science, Engineering and Industry
2016-11-10Functional Programming Over Sets with Atoms
2016-11-10Logic and Bisimulation for Guarded Teams
2016-11-09Braid Groups, Hecke Algebras, Representations, and Anyons
2016-11-09FO-Definable Constraint Satisfaction Problems
2016-11-09Reducts of Finitely Bounded Homogeneous Structures, and...
2016-11-09Power and Limits of LP and SDP Relaxations


Tags:
Thomas Colcombet
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
{Symmetry Logic Computation}