Fractal geometry, Turing machines and divide-and-conquer recurrences

DOI10.1051/ita/1994283-404051zbMath0883.68056OpenAlexW192349721MaRDI QIDQ4366726

No author found.

Publication date: 20 November 1997

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92487

zbMATH Keywords

iterated function systemsfractal geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Algorithms to test open set condition for self-similar set related to P.V. numbers ⋮ Chain-code pictures and collages generated by hyperedge replacement ⋮ Self-similar fractals: an algorithmic point of view ⋮ A DRIVEN IFS REPRESENTATION OF TURING MACHINES ⋮ Selected Decision Problems for Square-Refinement Collage Grammars

Cites Work

• Affine automata and related techniques for generation of complex images
• Digital sundials, paradoxical sets, and Vitushkin's conjecture
• ENCODING IMAGES AS WORDS AND LANGUAGES
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Using fractal geometry for solving divide-and-conquer recurrences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fractal geometry, Turing machines and divide-and-conquer recurrences