1:03:33$L^2$-Betti numbers and computability of reals - Clara Löh (University Regensburg)
A 64-minute video from Computability: “$L^2$-Betti numbers and computability of reals - Clara Löh (University Regensburg)”.
Computability
446 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
1:03:33
27:24A Characterization of the Strongly η-Representable Many-One Degrees - Josiah Jacobsen-Grocott (UW)
A 27-minute video from Computability: “A Characterization of the Strongly η-Representable Many-One Degrees - Josiah Jacobsen-Grocott (UW)”.
55:37A Survey on Analog Models of Computation - Amaury Pouly (CNRS)
A 56-minute video from Computability: “A Survey on Analog Models of Computation - Amaury Pouly (CNRS)”.
53:15A local approach towards uniform Martin’s conjecture - Vittorio Bard (Torino)
A 53-minute video from Computability: “A local approach towards uniform Martin’s conjecture - Vittorio Bard (Torino)”.
43:18A non-trivial 3-REA set not computing a 3-generic - Peter Gerdes (IU Bloomington)
A 43-minute video from Computability: “A non-trivial 3-REA set not computing a 3-generic - Peter Gerdes (IU Bloomington)”.
54:56A theorem from Rival and Sands and reverse mathematics - Marta Fiori Carones
A 55-minute video from Computability: “A theorem from Rival and Sands and reverse mathematics - Marta Fiori Carones”.
48:27Adam Topaz (University of Alberta) - Formalizing Lawvere theories in dependent type theory
A 48-minute video from Computability: “Adam Topaz (University of Alberta) - Formalizing Lawvere theories in dependent type theory”.
47:07Algorithmic learning of structures - Ekaterina Fokina (TU Wien)
A 47-minute video from Computability: “Algorithmic learning of structures - Ekaterina Fokina (TU Wien)”.
57:04Algorithmic randomness and Bayesian convergence - Francesca Zaffora Blando (CMU)
A 57-minute video from Computability: “Algorithmic randomness and Bayesian convergence - Francesca Zaffora Blando (CMU)”.
58:50An introduction to Borel reducibility I - Matthew Harrison-Trainor
A 59-minute video from Computability: “An introduction to Borel reducibility I - Matthew Harrison-Trainor”.
58:58An introduction to Borel reducibility II - Matthew Harrison-Trainor
A 59-minute video from Computability: “An introduction to Borel reducibility II - Matthew Harrison-Trainor”.
1:05:39Arithmetic under negated induction - Tin Lok Wong (National University of Singapore)
A 66-minute video from Computability: “Arithmetic under negated induction - Tin Lok Wong (National University of Singapore)”.
1:02:16Arrow's theorem and the reverse mathematics of social choice theory - Benedict Eastaugh (Warwick)
A 62-minute video from Computability: “Arrow's theorem and the reverse mathematics of social choice theory - Benedict Eastaugh (Warwick)”.
59:59Aspects of Hausdorff Dimension - Theodore Slaman
A 60-minute video from Computability: “Aspects of Hausdorff Dimension - Theodore Slaman”.
6:43Asymptotic notions of computability - Tiago Royer (UChicago) (part 1)
A 7-minute video from Computability: “Asymptotic notions of computability - Tiago Royer (UChicago) (part 1)”.
47:48Asymptotic notions of computability - Tiago Royer (UChicago) (part 2)
A 48-minute video from Computability: “Asymptotic notions of computability - Tiago Royer (UChicago) (part 2)”.
1:02:46Automorphism argument and reverse mathematics - Keita Yokoyama (JAIST)
A 63-minute video from Computability: “Automorphism argument and reverse mathematics - Keita Yokoyama (JAIST)”.
35:27Between philosophy and reverse mathematics - Benedict Eastaugh
A 35-minute video from Computability: “Between philosophy and reverse mathematics - Benedict Eastaugh”.
34:34Between philosophy and reverse mathematics - Walter Dean
A 35-minute video from Computability: “Between philosophy and reverse mathematics - Walter Dean”.
46:58Bi-embeddability relation on computable structures - Ekaterina Fokina
A 47-minute video from Computability: “Bi-embeddability relation on computable structures - Ekaterina Fokina”.
1:10:21Big in RM : the uncountability of R - Sam Sanders
A 70-minute video from Computability: “Big in RM : the uncountability of R - Sam Sanders”.
52:21Borel order dimension - Dilip Raghavan (NUS)
A 52-minute video from Computability: “Borel order dimension - Dilip Raghavan (NUS)”.
28:20Cantor-Bendixson Theorem in the Weihrauch lattice - Vittorio Cipriani (University of Udine)
A 28-minute video from Computability: “Cantor-Bendixson Theorem in the Weihrauch lattice - Vittorio Cipriani (University of Udine)”.
53:31Characterization of Weihrauch reducibility - Patrick Uftring (TU Darmstadt)
A 54-minute video from Computability: “Characterization of Weihrauch reducibility - Patrick Uftring (TU Darmstadt)”.
54:22Classifying word problems - Luca San Mauro (Vienna University of Technology)
A 54-minute video from Computability: “Classifying word problems - Luca San Mauro (Vienna University of Technology)”.
1:11:13Coding in reverse mathematics - Carl Mummert
A 71-minute video from Computability: “Coding in reverse mathematics - Carl Mummert”.
55:07Coding in structures - Matthew Harrison Trainor
A 55-minute video from Computability: “Coding in structures - Matthew Harrison Trainor”.
46:37Coding in the automorphism group of a structure - Dan Turetsky (Victoria University of Wellington)
A 47-minute video from Computability: “Coding in the automorphism group of a structure - Dan Turetsky (Victoria University of Wellington)”.
27:11Comparing induction and bounding principles over RCA0 and RCA0* - Sarah Reitzes (U. of Chicago)
A 27-minute video from Computability: “Comparing induction and bounding principles over RCA0 and RCA0* - Sarah Reitzes (U. of Chicago)”.
55:07Complexity of root-taking in power series fields & related problems - Karen Lang (Wellesley College)
A 55-minute video from Computability: “Complexity of root-taking in power series fields & related problems - Karen Lang (Wellesley College)”.
48:12Computability Theoretic Aspects of Dobrinen’s Result on Triangle Free Graphs - Peter Cholak (ND)
A 48-minute video from Computability: “Computability Theoretic Aspects of Dobrinen’s Result on Triangle Free Graphs - Peter Cholak (ND)”.
42:01Computability of Algebraic and Definable Closure - Nate Ackerman (Harvard)
A 42-minute video from Computability: “Computability of Algebraic and Definable Closure - Nate Ackerman (Harvard)”.
45:47Computability of Harmonic Measure - Cristóbal Rojas (Pontifical Catholic University of Chile)
A 46-minute video from Computability: “Computability of Harmonic Measure - Cristóbal Rojas (Pontifical Catholic University of Chile)”.
47:08Computable isomorphism problem - Valentina Harizanov (George Washington University)
A 47-minute video from Computability: “Computable isomorphism problem - Valentina Harizanov (George Washington University)”.
54:29Computing descending sequences in linear orderings - Jun Le Goh (UW Madison)
A 54-minute video from Computability: “Computing descending sequences in linear orderings - Jun Le Goh (UW Madison)”.
1:15:00Constructive reverse mathematics of Gödel's completeness theorem - Hugo Herbelin
A 75-minute video from Computability: “Constructive reverse mathematics of Gödel's completeness theorem - Hugo Herbelin”.