No label defined (Q4460840)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2063224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2063224 |
Statements
29 March 2004
0 references
computable analysis
0 references
polynomial-time computability
0 references
fractals
0 references
Julia sets
0 references
Hausdorff dimension
0 references
survey
0 references
0.8633601665496826
0 references
0.817876935005188
0 references
0.7926914691925049
0 references
0.7844265103340149
0 references
0.7809199094772339
0 references
This is a survey of recent work on computability and computational complexity of two-dimensional regions and (Jordan or fractal) curves, within the framework of computable analysis based on the Turing machine model. In particular, the paper studies relationships between the computability (and polynomial-time computability, respectively) of curves and of their lengths, their interiors, their Hausdorff dimensions and their Hausdorff measures, as well as relationships between computability (resp., polynomial-time computability) of real functions and of their Julia sets. For the entire collection see [Zbl 1030.03004].
0 references