Re: Interfacing Ada With Full Runtime Directly to Electronic Chips

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On 2017-01-03 21:50, Shark8 wrote:
> On Tuesday, January 3, 2017 at 1:34:31 PM UTC-7, Dmitry A. Kazakov wrote:
>> On 2017-01-03 19:02, Shark8 wrote:
>>> On Tuesday, January 3, 2017 at 3:34:33 AM UTC-7, Dmitry A. Kazakov wrote:
>>>> On 2017-01-03 06:33, Shark8 wrote:
>>>>
>>>>> That's really interesting, because the system I want to do
>>>>> [ultimately] is a ternary computer -- for which tri-state logic is a
>>>>> perfect fit.
>>>>
>>>> Out of curiosity, why tri-state logic and not full four-state one?
>>>> Tri-state is incomplete in some operations (e.g. in implication).
>>>
>>> The completeness of the logic-system depends on which logic-system
>>> is  being used -- there are several for three-valued logic -- but it is a
>>> non-issue because you can use full Boolean logic (e.g.) by defining 0 to
>>> be True and ±1 to be False (i.e. using inverse-logic).*
>>
>> [...]
>>
>> I see, it is just a ternary system and not logic in the sense of lattice
>> and inference, like {False, True, Unknown}.
>
> You can model True/False/Unknown -- just map each value to one of {1,0,J}, obviously.

Maybe

> But how would a lattice & inference system look? Esp. at the gate-level.

Logic gates? A lattice has "and", "or", "not", obeying de Morgan rules. 
They are same as Boolean when arguments are Boolean. E.g. the truth 
table for "and":

and F T U
--+------
F | F F F
T | F T U
U | F U U

I understood that this has little (if anything at all) to do with the 
system you had in mind. The similarity of names is coincidental.

Considering flow of control in a logical system with "unknown" state. 
Let you have

    if A and B then
       S1;
    else
       S2;
    end if;

Let A = U and B = T. Then A and B = U. So both S1 and S2 must be 
evaluated but their side effects kept aside until some point, where you 
become certain what path was to choose. Then you commit the effects of 
this only path.

In fuzzy systems it is called defuzzification. I am not familiar with 
quantum computing, but I guess it is kind of similar to this. You 
"calculate" all possible states and at some point collapse all of them 
into just one.

Now if you had a forth state you wold follow no path if A and B would 
evaluate it. So it is "one"/true, "another"/false, "any", "none", a 
complete set of choices.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de