Asa H is a universal Turing machine

By limiting time shifting to one time step only (to provide "state"), disabling extrapolation, and by requiring the dot product match to be (nearly) perfect (within roundoff error) it is possible for Asa H 2.0 to simulate a universal Turing machine of the sort in Minsky's book.(Computation, Prentice Hall, 1967)