Data Structures for Quasistrict Higher Categories

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


Duration: 47:35
876 views
18

Jamie Vicary, University of Oxford
https://simons.berkeley.edu/talks/jamie-vicary-2016-12-05
Compositionality



Other Videos By Simons Institute for the Theory of Computing


2016-12-07Multipartite Composition of Contextuality Scenarios
2016-12-07Composition and Quantum Theory: A Conjecture, and How it Could Fail
2016-12-06Operational Semantics for Single-Particle Classical Thermodynamics
2016-12-06Automata Learning -- Infinite Alphabets and Application to Verification
2016-12-06Some Thoughts on Inferring System Structure
2016-12-06The Mathematics of Networks
2016-12-06Custom Compact Closed Categories via Relations
2016-12-06Composition in Some Formal Models of Natural Language
2016-12-06Modelling Interconnected Systems with Decorated Corelations
2016-12-05From Linearizability to Eventual Consistency
2016-12-05Data Structures for Quasistrict Higher Categories
2016-12-05An Operadic Approach to Compositionality
2016-12-05Compositionality, Adequacy, and Full Abstraction
2016-12-05Semantics for Physicists
2016-12-01Logic and Automata and Beyond
2016-11-18The Power of Predictions in Online Optimization
2016-11-18Above Average-Case Analysis?
2016-11-18When Existing Techniques in Linear Regression Preserve Differential Privacy
2016-11-18Monotone Estimation Framework and its Applications for Scalable Analytics of Large Data Sets
2016-11-18How Hard Is Inference for Structured Prediction?
2016-11-18Automated Scientific Discovery Using Insights from Problem Structure


Tags:
Compositionality
Jamie Vicary
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley