Hallam-Baker, Phillip wrote:
Trying to enforce that a Turing-complete machine have
capabilities "no greater than X" might seem to an IT senior manager
to be a really good idea, but in practical terms, it can't
be done.
Of course it can.
Simply put a trustworthy computing partition on the machine. Palladium is more
than capable of providing a proof that would be prohibitively expensive to
defeat.
I, and others, dispute that such "proofs" are proof of anything really
meaningful, and that defeating them would be
"prohibitively expensive to defeat". But that is territory that is
emphatically not part of the work of this
group.
_______________________________________________
Ietf mailing list
Ietf(_at_)ietf(_dot_)org
https://www1.ietf.org/mailman/listinfo/ietf