3 ms·
Yeah equality of computable reals is undecidable (basically the halting of a Turing machine can be encoded as a computable real being nonzero).
by Rerarom 4y ago
Yeah equality of computable reals is undecidable (basically the halting of a Turing machine can be encoded as a computable real being nonzero).