PATH and 10 Print Interpretation
From Maze
(Difference between revisions)
(Initial capsule description) | (Notes from the listserv) | ||
| Line 4: | Line 4: | ||
Exploring these approaches touches on many topics -- the definition of a maze, reimplementation, quines, visual interpretation, general computation. | Exploring these approaches touches on many topics -- the definition of a maze, reimplementation, quines, visual interpretation, general computation. | ||
| + | |||
| + | |||
| + | == Notes from the listserv == | ||
| + | |||
| + | <blockquote>Jeremy: [W]hile the output of Nick's one-liner *visually* specifies a kind of open maze, it was not immediately intuitive to me that the information contained in the character array contains a maze. I initially imagined that data to specify a maze should requiring empty hall and full wall (low bit/high bit) which is a very different thing from this wall of slashes that might as well be ps and qs. Such an encoding strategy can't be generated with any coherency by a random function -- if you use *s and spaces with such a simple algorith, you just get static. When I thought about it, however, I realized that the twisting passages visually implied by the slashes only require a very few rules to be specified / made executable. These rules are already implemented in the esoteric language Path -- just add a $ start-point to a random location in the output, and the Path programming language will happily execute a path that navigates through the structure of / and \ characters much as we would visually or physically, ending either trapped in a loop or falling off the edge of the space. '''This moment where the output of one programming language becomes (even unintentionally) a new program in another language is also something I'd love to explore in the book.'''</blockquote> | ||
