Ex Machina [10 - 37]

Biding time, until the day all circuits complete. [32]

The work of art in the age of mechanical reduction. [62]

The possibility of parallel functions. [50]

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

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

S↓E→2930313233343536373839404142434445
234334314432242243
334443435445362332
443223313233143134
544334314444254343
633325424443353343
723233223311342232
834344334422452243
913444234455342332
1042414533554344454
1153225443443244433
1244144335332343322
1333233233443343232
1423332324344353321
1532422132344233423
1644344334424354343
1732332422144234243
1854334434334354444
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