Ex Machina [23 - 44]

Arising from errors in the code [5]

Read the instruction and decode it. [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]

“Physiologically, man in the normal use of technology [...] is perpetually modified by it and in turn finds ever new ways of modifying his technology.” [34]

(ii) knowing i, twinned, with opposing goals [44]

S↓E→3637383940414243444546474849505152
1523442334234242244
1644243543433443434
1721442342435542245
1843343544444444333
1944442512322232434
2025442344545543343
2154523623433343545
2233442132231243244
2334332433544344245
2443554534222242454
2532433233342333332
2613432233444444134
2743353543324331444
2843132442444553444
2953644344213314465
3014341244444443234
3143412542444554444
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