Computation as uncertainty reduction: a simplified order-theoretic framework
P Hack, DA Braun, S Gottwald - arXiv preprint arXiv:2206.13885, 2022 - arxiv.org
Although there is a somewhat standard formalization of computability on countable sets
given by Turing machines, the same cannot be said about uncountable sets. Among the …
given by Turing machines, the same cannot be said about uncountable sets. Among the …