Jon Sterling on Nostr: nprofile1q…qlved nprofile1q…k6k5u I would say that I am taking the classical ...
nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpqfly2tde9flgrlqqsn2zxxuu6xwzfhaqln0akj3gk3zz6wa6k7a4sgqlved (nprofile…lved) nprofile1qy2hwumn8ghj7un9d3shjtnddaehgu3wwp6kyqpquy9xf9yrwzh9spkq732led29dxkc72klm2xtk8gvd33uwgd9wa9s3k6k5u (nprofile…6k5u) I would say that I am taking the classical definition to not have an explicit enumeration... You can tell that it doesn't because morphisms of automata are not required to preserve it. Even though any classical automaton can be equipped with these enumerations, the choices are not canonical, so this reveals what the actual definition is.
I would like to stress that my complaint is not about what happens when you do these things constructively. My complaint pertains to the *classical* computability of functions out of the space of all automata (without explicit enumerations, for the reasons I argued above).
I would like to stress that my complaint is not about what happens when you do these things constructively. My complaint pertains to the *classical* computability of functions out of the space of all automata (without explicit enumerations, for the reasons I argued above).