Pages that link to "Item:Q1295381"
From MaRDI portal
The following pages link to On the computability of fractal dimensions and Hausdorff measure (Q1295381):
Displayed 13 items.
- Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
- Computability of countable subshifts in one dimension (Q693067) (← links)
- Computability of measurable sets via effective topologies (Q818928) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Computability structure of the Sobolev spaces and its applications (Q1292420) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
- Conservatively Approximable Functions (Q3455861) (← links)
- Effective Symbolic Dynamics (Q4918032) (← links)
- (Q5114823) (← links)