The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...

The study of computable algebraic structures lies at the intersection of algebra, computer science and complexity theory. At its core, this field investigates how abstract algebraic systems can be ...

In this paper we consider how boundedly rational agents learn rational expectations. The assumption that agents are boundedly rational is made operational by imposing computability constraints on the ...