Computational Universality as Security Limit

Definition

Once a computational system becomes sophisticated enough to be Turing-complete (computationally universal), it becomes capable of arbitrary computation, which means it can be made to do both desired and undesired things, and proving security properties becomes undecidable

Cast within

No topic-region cast yet — this appears once Computational Universality as Security Limit's compiled claims are aligned into a topic region's argument tree.

Claims mentioning Computational Universality as Security Limit (1)

Your notes

Loading notes...