If we look at the pretty basic MiniMax algorithm for playing computer chess we can classify the traversed chess game tree as 5 dimensional, 1d - squares, 2d - pieces, 3d - color, 3.5d - time runnning forward as the sequence of the game, 4d - MiniMax algorithm moving back n forth, up n down in the game tree, and 5d - the computed permuations of the game tree of the initial chess position. Hereby the causality itself navigating the negentropy is moving always forward, relatively spoken, we just change the direction in the game tree. Question remains open if such a calculus can be implemented on a memetic level -> Xi calculus.