TY  - GENERIC
DO  - 10.20944/preprints201811.0301.v6
UR  - http://dx.doi.org/10.20944/preprints201811.0301.v6
TI  - On Sets ${\mathcal X} \subseteq$ $\mathbb N$ for Which We Know an Algorithm That Computes a Threshold Number $t({\mathcal X}) \in$ $\mathbb N$ Such That ${\mathcal X}$ Is Infinite If and Only If ${\mathcal X}$ Contains an eLement Greater Than $t({\mathcal X})$
T2  - Preprints
AU  - Tyszka, Apoloniusz
PY  - 2019
DA  - 2019/01/10
PB  - Preprints