text: Michael Bader developed cache-oblivious algorithms feature matrices whose element order is based on this type of function.
full_question: Michael Bader developed cache-oblivious algorithms feature matrices whose element order is based on this type of function. Exotic examples of these functions include Dekking's Church, an entity surrounded by "fudgeflakes," the Harter-Heighway dragon, and Bill Gosper's "flowsnake." E.H. Moore modified the procedure to make one of these functions to incorporate its looping step early, but that made its underlying L-system representation more complex. If a space is compact, connected, locally connected, and second countable, then one of these functions exists for that space by the Hahn-Mazurkiewicz theorem. Procedures for making these functions with Hausdorff dimension of two have been given by Waclaw Sierpinski and David Hilbert. A mapping from the unit interval to the unit square comprises, for 10 points, what shapes discovered by Giuseppe Peano that completely pervade a square?
first_sentence: Michael Bader developed cache-oblivious algorithms feature matrices whose element order is based on this type of function.
raw_answer: space filling curves [or space filling transformation; or a Peano space until it is read, prompt on "fractals"]