Ex Machina [10 - 40]

Malfunctioning perfectly, a clicking abortion. [20]

What you feared, what you now long for. [30]

The machine copied, [40]

S↓E→3233343536373839404142434445464748
234314432242243432
343435445362332234
423313233143134444
534314444254343344
625424443353343443
733223311342232433
844334422452243433
944234455342332222
1014533554344454544
1125443443244433433
1244335332343322332
1333233443343232233
1432324344353321123
1522132344233423424
1644334424354343344
1732422144234243554
1834434334354444444
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