Ex Machina [64 - 49]

You turn the page. [1]

The Book of Fire. [17]

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

The [ ] is the machine. [49]

S↓E→4142434445464748495051525354555657
4823323220335435554
4944221432034544443
5024334435304445454
5142221222330122331
5233132331421033332
5353121333134404333
5441132322231120332
5533332231243342044
5634445334424344404
5742133433332231220
5843312322233342113
5953421323444435454
6031133322334323113
6141221113244314444
6233444424313444343
6353454524444344445
6442443414444334445
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