Computability theory and applications

External homepage


Nagoya University / Pennsylvania State University / Swansea University / TU Wien - Technische Universität Wien / University of Connecticut / Universität der Bundeswehr München / Université de Lyon / Victoria University of Wellington

Audience: Researchers in the topic
Seminar series time: Tuesday 08:00-09:00 in your time zone, UTC
Organizers: Damir Dzhafarov*, Vasco Brattka*, Ekaterina Fokina*, Ludovic Patey*, Takayuki Kihara, Noam Greenberg, Arno Pauly, Linda Brown Westrick
*contact for this listing

Description: Computability theory, logic

The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.

Upcoming talks
Past talks
Your timeSpeakerTitle
TueApr 0410:00Juan AguileraDeterminacy in Second-Order Arithmetic
TueFeb 2114:00Valentino Delle RoseComputable PAC learning
MonJan 3020:00Linus RichterCo-analytic Counterexamples to Marstrand’s Projection Theorem
MonNov 2813:00Clara Löh$L^2$-Betti numbers and computability of reals
WedApr 2708:00Stefan VatevEffective embeddings for classes of structures via enumeration operators
MonApr 1820:30Jeff HirstThree views of LPO and LLPO
TueApr 1201:00Alexander MelnikovPrimitive recursive mathematics
MonApr 0420:30Jun Le GohExtensions of embeddings in the $\Sigma^0_2$ enumeration degrees
WedMar 3000:00Valentina HarizanovComputable isomorphism problem
MonMar 2120:30Meng Che "Turbo" HoZero-one laws for finitely presented structures
WedMar 1613:00Rupert HölzlRank and Randomness (Cancelled)
TueMar 0120:00Peter CholakOld and new results on the computably enumerable sets
MonFeb 2121:30Ekaterina FokinaAlgorithmic learning of structures
TueFeb 1501:00Yue YangStrong minimal pair problem
MonFeb 0721:30Matthew Harrison-TrainorKolmogorov extractors and evenly-distributed hypergraphs
TueFeb 0116:00Emmanuel RauzyComputable analysis on the space of marked groups
MonJan 2421:30Donald StullThe dimension spectrum conjecture for lines
TueJan 1112:00Matthew de BrechtThe category of quasi-Polish spaces as a represented space
WedDec 1509:00Tin Lok WongArithmetic under negated induction
MonDec 0621:30Francesca Zaffora BlandoAlgorithmic randomness and Bayesian convergence
TueNov 3020:00Karen SeidelModelling binary classification
MonNov 2221:30Elvira MayordomoExtending the reach of the point-to-set principle
MonNov 0821:30Cristóbal RojasComputability of Harmonic Measure
TueNov 0220:00Dino RosseggerNew examples of degrees of categoricity
MonOct 2521:00Diego RojasEffective convergence notions for measures on the real line
MonOct 2520:30Sarah ReitzesComparing induction and bounding principles over RCA0 and RCA*0
MonOct 1121:00David WebbTBA
MonOct 1120:30Vittorio CiprianiCantor-Bendixson Theorem in the Weihrauch lattice
TueOct 0513:00Takayuki KiharaLawvere-Tierney topologies for computability theorists
MonSep 2720:30Benoit MoninThe computational content of Milliken’s tree theorem
MonSep 1321:00Josiah Jacobsen-GrocottA Characterization of the Strongly η-Representable Many-One Degrees
MonSep 1320:30Rachael AlvirFinitely α-generated Structures
TueJun 0813:00Pavel SemukhinThe Membership Problem for 2x2 integer matrices
ThuJun 0301:00Liang YuSome consequences of TD and sTD.
MonMay 0320:30Andre NiesMaximal towers and ultrafilter bases in computability theory
TueApr 2016:00Vasco BrattkaThe Discontinuity Problem
MonApr 1920:30Noam GreenbergThe strength of Borel Wadge comparability
TueApr 1308:00David BelangerMaximal order types of well partial orders
TueApr 0608:00Merlin CarlComplexity and Decision Times for ITTMs - The Story of the Bold Conjecture
MonApr 0520:30Julia KnightDescribing structures and classes of structures
WedMar 3101:00Steffen LemppDecidability and Undecidability in the Enumeration Degrees
TueMar 2314:00Iskander KalimullinPunctual categoricity and degrees of punctual categoricity for finitely generated structures.
MonMar 1520:30Chris ConidisThe Reverse Mathematics of Noether's Decomposition Lemma
TueMar 0917:00Verónica BecherOpen questions on randomness and uniform distribution
TueMar 0213:00Luca San MauroClassifying word problems
MonMar 0121:30Kirsten EisenträgerA topological approach to undefinability in algebraic extensions of the rationals
TueFeb 2320:00Jeff HirstCurrent thoughts on Hindman’s Theorem
MonFeb 1521:30Verónica BecherNormal numbers and perfect necklaces
TueFeb 0913:00Victor SelivanovPrimitive recursive ordered fields and some applications
TueFeb 0215:00Mathieu HoyrupThe fixed-point property for represented spaces
MonFeb 0121:30Arno PaulyThe structure of Weihrauch degrees - what we know and what we don't know
TueJan 2615:00Giovanni SoldàRival-Sands principles in the Weihrauch degrees
TueJan 1909:00Emanuele FrittaionGeneric realizability for intuitionistic set theory
WedDec 1600:30Keita YokoyamaAutomorphism argument and reverse mathematics
TueDec 0821:00Linda Brown WestrickLuzin's (N) and randomness reflection
TueNov 2421:00Karen LangeComplexity of root-taking in power series fields & related problems
TueNov 1723:00Bjørn Kjos-HanssenA family of metrics connecting Jaccard distance to normalized information distance
TueNov 1021:00Paul ShaferRandomness notions and reverse mathematics
TueNov 1014:00Laurent BienvenuThe interplay between randomness and genericity
TueNov 0314:00Manlio ValentiOn the descriptive complexity of Fourier dimension and Salem sets
TueOct 2720:00Li Ling KoFickleness and bounding lattices in the recursively enumerable Turing degrees
TueOct 2014:00Alexandra SoskovaEffective embeddings and interpretations
WedOct 1401:00Chris ConidisNon-arithmetic algebraic constructions
TueOct 1320:00Leszek KołodziejczykReverse mathematics of combinatorial principles over a weak base theory
TueOct 0613:00Paul-Elliot Angles d'AuriacThe computable strength of Milliken's Tree Theorem and applications
TueSep 2920:00Christopher PorterEffective Dimension and the Intersection of Random Closed Sets
WedSep 2300:00Timothy McNichollWhich Lebesgue spaces are computably presentable?
TueSep 1520:00Justine MillerNoncomputable Coding, Density, and Stochasticity
TueSep 1513:00Alberto MarconeThe higher levels of the Weihrauch lattice
TueSep 0814:00Patrick UftringThe characterization of Weihrauch reducibility in systems containing $E$-$PA^\omega$ + $QF$-$AC^{0,0}$
TueSep 0120:00Patrick LutzPart 1 of Martin's Conjecture for Order Preserving Functions
WedAug 2601:00Andre NiesDiscovering structure within the class of K-trivial sets
TueAug 1820:00Joe MillerRedundancy of information: lowering effective dimension
TueAug 1114:00Jun Le GohComputing descending sequences in linear orderings
TueAug 0414:00Benoit MoninGenericity and randomness with ITTMs
TueJul 2821:00Andrew MarksPriority arguments in descriptive set theory
TueJul 2115:00Cristóbal RojasStatistical Chaos — a new barrier in the prediction/simulation of physical systems
TueJul 1420:00Mariya SoskovaPA relative to an enumeration oracle
WedJul 0801:00Rod DowneySacks' Splitting Theorem Re-examined (again)
TueJun 3014:00Amaury PoulyA Survey on Analog Models of Computation
TueJun 2320:00Sarah ReitzesReduction games, provability, and compactness
WedJun 1701:00Lu LiuThe coding power of products of partitions
TueJun 0914:00Nikolai BazhenovRogers semilattices in the analytical hierarchy
TueJun 0214:00Vittorio BardA local approach towards uniform Martin’s conjecture
WedMay 2701:00Dan TuretskyCoding in the automorphism group of a structure
TueMay 1920:00Denis HirschfeldtMinimal pairs in the generic degrees
WedMay 1301:00Matthew Harrison-TrainorThe tree of tuples of a structure
TueMay 0520:00Marta Fiori CaronesA theorem from Rival and Sands and reverse mathematics
TueApr 2812:00Julia KnightLimiting Density and Free Structures
TueApr 2114:00Theodore SlamanRecursion Theory and Diophantine Approximation
Embed this schedule
Export series to