### Boole’s Rings

- A POW problem that can incentivize the energy efficient CNOT computer. November 18, 2017 Joseph Van Name
- A remark on Schimmerling’s question November 14, 2017 Assaf Rinot
- Classification of countable models of PA and ZFC November 14, 2017 Samuel Coskey
- A universal finite set, CUNY Logic Workshop, November 2017 November 11, 2017 Joel David Hamkins
- Security report for R5, the POW problem for Nebula. November 9, 2017 Joseph Van Name

### Comments on Boole’s Rings

- Comment on Trust me, I’m a doctor! by Stefan Mesken November 15, 2017 Comments for Asaf Karagila
- Comment on A universal finite set, CUNY Logic Workshop, November 2017 by Mohammad November 12, 2017 Comments for Joel David Hamkins
- Comment on Famous quotations in their original first-order language by Joel David Hamkins November 10, 2017 Comments for Joel David Hamkins
- Comment on Famous quotations in their original first-order language by Dee November 10, 2017 Comments for Joel David Hamkins
- Comment on The eightfold way by saf November 6, 2017 Comments for Assaf Rinot

# 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