most citedThe classification of preordered spaces in terms of monotones: complexity and optimization

8 citations · 24 across the 8 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2022

Countability constraints in order-theoretic approaches to computability

Pedro Hack, Daniel A. Braun, Sebastian Gottwald

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in…