Computability of the packing measure of totally disconnected self-similar sets (Q2828033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computability of the packing measure of totally disconnected self-similar sets |
scientific article; zbMATH DE number 6642632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computability of the packing measure of totally disconnected self-similar sets |
scientific article; zbMATH DE number 6642632 |
Statements
Computability of the packing measure of totally disconnected self-similar sets (English)
0 references
24 October 2016
0 references
packing measure
0 references
self-similar set
0 references
0 references
0 references
0 references
The authors offer an algorithm for computing the packing measure of totally disconnected self-similar sets, and test it with certain examples.
0 references
0.8760949969291687
0 references
0.8584704399108887
0 references
0.8417711853981018
0 references
0.833879292011261
0 references
