Pages that link to "Item:Q5274810"
From MaRDI portal
The following pages link to Computability in Analysis and Physics (Q5274810):
Displaying 6 items.
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- Computability of finite-dimensional linear subspaces and best approximation (Q638485) (← links)
- Computability and the morphological complexity of some dynamics on continuous domains (Q930875) (← links)
- A refined model of computation for continuous problems (Q1265141) (← links)
- The prime number theorem is PRA-provable (Q5941260) (← links)
