[E-Lang] Re: Identity et al [was: ALU capability]
Jonathan A Rees
Mon, 22 Oct 2001 08:40:13 -0700
Date: Sun, 21 Oct 2001 19:34:12 -0700
From: Dean Tribble <firstname.lastname@example.org>
In a sequential language, the verifier process proceeds such that, after
the challenge from the verifier returns back to the verifier, then either
the object being tested has stored itself into the secret verification
place or it didn't. There is no race, there is no delay, and there is no
uncertainty about timing.
I still don't get it. The verifier gives the CPU to the object to be
verified. If the object to be verified has the property that it never
terminates (and never sends a message), how can the verifier ever
Maybe I don't know what you mean by "sequential language".