Ex Machina [59 - 12]

An unreadable score. Unbearable music. [18]

Concurrent Read Concurrent Write [11]

Tesseract [12]

S↓E→4567891011121314151617181920
4824354333432433422
4914344222323331233
5022454532334131334
5144532243443233334
5233433342333222333
5323434232322232224
5433513343234223444
5533421242331323133
5633443442334322333
5733521443333133334
5831412332222223244
5945554142333423134
6033432343322232223
6134443233432333223
6232444431223212243
6335543444544552434
6434443333443542333
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