On Tuesday, 12 August 2014 at 04:50:15 UTC, Kagamin wrote:
Logic is ordered, and we have a notion of order because we know
time, which is the only obviously ordered thing in nature. So
in a sense any logic has time in its foundation and math can do
the reverse: represent time in declarative manner.
No, there is no order to boolean expressions. Deduction can be
performed bottom up. Imperative programs rely on top down
execution due to side effects.
Recall that all pure functions over finite types can be
implemented as tables. A table lookup is O(1). No time.
