assert semantic change proposal

via Digitalmars-d digitalmars-d at puremagic.com
Tue Aug 12 02:17:52 PDT 2014


On Tuesday, 12 August 2014 at 08:07:01 UTC, Kagamin wrote:
> A true reversal would be when preconditions are derived from 
> postconditions.

That's how you conduct a proof…

>> 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.

Not at all. You can create a boolean expression for every bit of 
output and evaluate it only using NAND gates (or NOR). Not 
practical, but doable…


More information about the Digitalmars-d mailing list