The tension: between the desire for life and the desire to break down, grinding away at some purpose. [60]
What you want from the book is for it to describe, in the physical fact of its pages, or the conceptual framework of its digital code, a world in which there is order, movement along familiar axes. [55]
Breaking the bounds of one universe, recoiling from its physics, to shunt the things of this world into another. [59]
An infinity of strings, harps without angels. [9]
| S↓E→ | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 |
| 25 | |||||||||||||||||
| 26 | |||||||||||||||||
| 27 | |||||||||||||||||
| 28 | |||||||||||||||||
| 29 | |||||||||||||||||
| 30 | |||||||||||||||||
| 31 | |||||||||||||||||
| 32 | |||||||||||||||||
| 33 | |||||||||||||||||
| 34 | |||||||||||||||||
| 35 | |||||||||||||||||
| 36 | |||||||||||||||||
| 37 | |||||||||||||||||
| 38 | |||||||||||||||||
| 39 | |||||||||||||||||
| 40 | |||||||||||||||||
| 41 |
This online application automatically generates rule-abiding nonlinear readings of Ex Machina, as originally written by Jonathan Ball, whose first print edition was published by Book*Hug in 02009.
This literary stress-test assists in performing a qualitative analysis under the following hypothesis: nonlinear constructions of Ex Machina are semantically and poetically inferior to the first published linear construction. The methodology is adjustable due to lack of instruction in the original text, but the current simulation available is limited due to media porting instability. (In this case, a textuality deficiency with regards to physical media from the text's self-referential nature of itself being a printed and bounded book.)
The equivalent null-hypothesis would therefore state that rule-abiding nonlinear structures would make an equal or greater amount of sense as a linear reading of the original manuscript.
The methodology for this experiment uses an improvisation upon Edsger Dijkstra's graph-based pathfinding algorithm, unweighted. It accepts two parameters before running: starting location and desired ending location. It will then search for the shortest possible path between these two subsets. (Some possible sets of the same shortest length with different contents may exist.)