Ex Machina [26 - 37]

“the machine is poetry” [50]

It is the root, the cause of machines. [17]

The machine that, thinking, chooses suicide. [37]

S↓E→2930313233343536373839404142434445
1854334434334354444
1923333324444251232
2041433532544234454
2134144435452362343
2232324423344213223
2343421423433243354
2433443134355453422
2543433423243323334
2641331331343223344
2724444424335354332
2844334424313244244
2904345245364434421
3040322431434124444
3154034424341254244
3251403422445234454
3332340342352332244
3432344033254342312
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