Boole’s Rings- Inclusion modulo nonstationary June 20, 2019 Assaf Rinot
- Tuna Altinel June 6, 2019 Nick Gill
- Completely ineffable cardinals June 5, 2019 Victoria Gitman
- Some cute observations about computably saturated models June 4, 2019 Victoria Gitman
- Alan Turing’s theory of computation, Oxford and Cambridge Club, June 2019 June 2, 2019 Joel David Hamkins
- Comments on Boole’s Rings
- Comment on How to count by Joel David Hamkins May 30, 2019 Comments for Joel David Hamkins
- Comment on How to count by A witness to the writhing void May 29, 2019 Comments for Joel David Hamkins
- Comment on 50 Years of Set Theory in Toronto, May 2019 by saf May 26, 2019 Comments for Assaf Rinot
- Comment on The multiverse view in set theory, Singapore 2011 by A multiverse perspective on the axiom of constructiblity | Joel David Hamkins May 20, 2019 Comments for Joel David Hamkins
- Comment on Modal principles of potentialism, Oxford, January 2018 by David Roberts May 12, 2019 Comments for Joel David Hamkins
Tag Archives: computable analysis
Computable roots of computable functions
Here are several interesting results from computable analysis: Theorem 1. If $f$ is a computable function from $\mathbb{R}$ to $\mathbb{R}$ and $\alpha$ is an isolated root of $f$, then $\alpha$ is computable. Corollary 2. If $p(x)$ is a polynomial over … Continue reading