Ex Machina [46 - 37]

[ ]. [44]

[ ] is still. [37]

S↓E→2930313233343536373839404142434445
3834334334302333343
3944344334350454343
4032414533424045343
4133435534445304333
4212334323444240232
4333132233332342023
4434335335164464401
4524244245253453410
4622344333254342412
4721233422443231332
4843434134355323323
4913333313244244221
5043433231245224334
5133334334343342221
5243223233343233132
5323223314333153121
5423233334422341132
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