8 citations · 24 across the 8 of their papers we have counts for
1 paper · 1 filter
Pedro Hack, Daniel A. Braun, Sebastian Gottwald
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 approache…