Order-theoretic models for decision-making: Learning, optimization, complexity and computation
P Hack - arXiv preprint arXiv:2406.10730, 2024 - arxiv.org
The study of intelligent systems explains behaviour in terms of economic rationality. This
results in an optimization principle involving a function or utility, which states that the system …
results in an optimization principle involving a function or utility, which states that the system …
Countability constraints in order-theoretic approaches to computability
P Hack, DA Braun, S Gottwald - Mathematical Structures in …, 2024 - cambridge.org
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 …
sets, which is given by Turing machines. Some of the approaches to define computability in …
On the relation of order theory and computation in terms of denumerability
P Hack, DA Braun, S Gottwald - arXiv preprint arXiv:2206.14484, 2022 - arxiv.org
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 …
sets, which is given by Turing machines. Some of the approaches to define computability in …