Inexpressibility in Exp-Minus-Log
TL;DR - all numbers defined in EML are computable (mainly because exp and log are computable for computable complex inputs, and the primary input ('1') is ofc computable) - this isn't as obvious as first thought, and you need some machinery from computable analysis. Ultimately, you get the canonical
ORIGINAL SOURCE →via Lobsters
ADVERTISEMENT
⚡ STAY AHEAD
Events like this, convergence-verified across 689 sources, land in your inbox every Sunday. Free.
GET THE SUNDAY BRIEFING →RELATED · conflict
- [CONFLICT] Intermodal Asia
- [CONFLICT] Securing the Untrusted Agentic Development Layer
- [CONFLICT] Ev alacaklar dikkat! Tapuda renk detayı: Kahverengi güvence, turkuaz risk mi?
- [CONFLICT] SON DAKİKA! Mali düzenlemelere ilişkin kanun teklifi TBMM'de
- [CONFLICT] Fenerbahçe, Final Four için parkeye çıkıyor
- [CONFLICT] Galatasaray, Bertuğ Yıldırım transferinde gaza bastı