Ex Machina [16 - 50]

They are broken and repaired. [13]

“[T]here is no a priori improbability in the descent of conscious (and more than conscious) machines from those which now exist, except that which is suggested by the apparent absence of anything like a reproductive system in the mechanical kingdom. This absence however is only apparent, as I shall presently show.” [15]

“The machine world reciprocates man's love by expanding his wishes and desires, namely, in providing him with wealth.” [26]

“the machine is poetry” [50]

S↓E→4243444546474849505152535455565758
822434332422313333
923322223554255554
1044545443343544444
1144334334223442332
1233223323412331221
1332322332323422312
1433211231354454444
1534234242244354444
1643433443434533323
1742435542245554443
1844444444333443433
1912322232434133423
2044545543343544444
2123433343545244534
2232231243244454443
2333544344245443334
2434222242454355545
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