On Tuesday, 12 August 2014 at 05:47:22 UTC, Ola Fosheim Grøstad
wrote:
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.
A true reversal would be when preconditions are derived from
postconditions.
Recall that all pure functions over finite types can be
implemented as tables. A table lookup is O(1). No time.
That's different logic, and algorithmic complexity is time.
