Ex Machina [25 - 15]

the words [22]

at random [4]

The illuminated book, painted with metal and bound in skin. [43]

Readers discuss, compare data; connect and reconnect. The poem is reshaped. Some variations wither. Others burn as stars, then are gone. [15]

S↓E→7891011121314151617181920212223
1745422334340353443
1843541223312135254
1943243211233204342
2043522334434250445
2154334322343314053
2244222333322331303
2344542323313242440
2454344431433424352
2532333434431442414
2644521234232242434
2744333323312344344
2824523334332453433
2965244543544333224
3044511234323141335
3144523323342443353
3254522323323252444
3343433433242331433
Full Pathfinding Graph

Colophon

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.)


Return to Literature Index