<dd><ahref="https://gitlab.constantvzw.org/unbound/cc4r">Collective Conditions for (re-)use (CC4r), June 2021</a></dd>
<dt></dt>
<ddclass="read-online-link"><ahref="">Read the book online ⤤</a></dd>
<ddclass="read-online-link"><ahref="http://paseo-por-arboles.algoliterarypublishing.net/">Read the book online ⤤</a></dd>
</dl>
</summary>
<p>In this book, the Markov Chain algorithm simultaneously generates a poem and a walk along trees in the neighbourhood Las Letras in the centre of Madrid. Despite the impression that there are few trees in the neighbourhood, the algorithm counts 460 of them. Markov Chain was designed in 1906 by Andrey Markov, a Russian mathematician who died in 1992. This algorithm is at the basis of many softwares that generate spam. It is used for systems that describe a series of events that are interdependent. What happens depends only on the previous step. That is why Markov Chains are also called "memoryless".</p>
<dd><ahref="https://gitlab.constantvzw.org/unbound/cc4r">Collective Conditions for (re-)use (CC4r), June 2021</a></dd>
<dt></dt>
<ddclass="read-online-link"><ahref="">Read the book online ⤤</a></dd>
<ddclass="read-online-link"><ahref="http://grafted-trees.algoliterarypublishing.net/">Read the book online ⤤</a></dd>
</dl>
</summary>
<p>'Grafted trees' takes quotes about trees from existing works. Each graft is defined by its gardener, who is present with a short biography scraped from Wikipedia. The reader chooses the amount of seasons the graft will grow. A random noun is picked and defined as a 'bud' from which a new branch grows by replacing the word by its definition. The algorithm is inspired by Oulipo's constraint of 'Littérature définitionnelle', invented by <ahref="https://en.wikipedia.org/wiki/Marcel_B%C3%A9nabou">Marcel Bénabou</a> in 1966: in a given phrase, one replaces every significant element (noun, adjective, verb, adverb) by one of its definitions in a given dictionary; one reiterates the operation on the newly received phrase, and again. </p>
