Despite being relatively small, my department has three faculty in finite combinatorics, in addition to having me in logic. I recently gave a series of two talks in our seminar to present a broad overview of classical computability theory, and to present some more recent applications to mathematics, via Reverse Mathematics and via Weihrauch Reducibility.

### Boole’s Rings

- A variety of mathematical proof-of-work problems will provide better security for cryptocurrencies than hash-based proof-of-work problems May 24, 2017 Joseph Van Name
- Euclidean Ramsey Theory 2 – Ramsey DocCourse Prague 2016 May 24, 2017 Mike Pawliuk
- Graphs obtained from endomorphic Laver tables May 16, 2017 Joseph Van Name
- Moment of Zen May 16, 2017 Asaf Karagila
- Kaethe Lynn Bruesselbach Minden, PhD 2017, CUNY Graduate Center May 12, 2017 Joel David Hamkins

### Comments on Boole’s Rings

- Comment on A program that accepts exactly any desired finite set, in the right universe by Joel David Hamkins May 26, 2017 Comments for Joel David Hamkins
- Comment on Infinite Combinatorial Topology by saf May 25, 2017 Comments for Assaf Rinot
- Comment on Infinite Combinatorial Topology by Ari Brodsky May 25, 2017 Comments for Assaf Rinot
- Comment on A Microscopic approach to Souslin-tree constructions. Part I by saf May 24, 2017 Comments for Assaf Rinot
- Comment on Math for nine-year-olds: fold, punch and cut for symmetry! by Symmetry – G∞AT May 23, 2017 Comments for Joel David Hamkins