On Tue, Jul 16, 2024 at 1:27 AM Quentin Anciaux <[email protected]> wrote:
*> Again you're arguing past one another, Brent conflate UTM with a turing > machine, but not all turing machines are UTM (universal), but any UTM can > emulate any other turing machine.* > I agree with that. And I would add that if something is computable then there exists a Turing Machine that can compute it, but not everything is computable. For example, the Busy Beaver function is not computable because, as Alan Turing discovered, the Halting Problem is not computable. John K Clark See what's on my new list at Extropolis <https://groups.google.com/g/extropolis> yqt -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/CAJPayv0-bXXsXuTqeuBcfV4pEeC6Vo%3DD%3DjUzk%3D6otSdM%2BDY8TA%40mail.gmail.com.
