Ex Machina [37 - 51]

The [ ] in the machine. [10]

The machine is waiting for when it has a use for you. [6]

Any device that transmits or modifies energy. [2]

The book that you write, to discover. [52]

The poem is written. [51]

S↓E→4344454647484950515253545556575859
2942133144654666554
3044444432345534434
3124445544445444335
3245443542455445344
3324443341543422433
3431231434432444342
3534333422345334233
3644434433345434334
3733254314545555442
3834334423334231433
3934334434334334234
4034354423556453443
4133323423555555443
4223241224431444432
4302343333443322413
4440143425544555553
4541033335553556453
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