In , a computational procedure (Procedure 2) - combining quantum randomness and the active element machine (AEM) - executes a universal Turing machine with Turing incomputable firing patterns. The procedure emulates any-digital computer program so its computational steps are incomprehensible to an external observer. This procedure's purpose is to hinder malware authors. An AEM consists of computational primitives called active elements that simultaneously transmit and receive pulses to and from other active elements. Each pulse has an amplitude and a width, indicating how long the pulse amplitude lasts as input to the element receiving the pulse. If element E_i simultaneously receives pulses with amplitudes summing to a value greater than E_i threshold and E_i's refractory period has expired, then E_i fires. If E_i fires at time t and a non-zero connection exists from E_i to E_k, a pulse reaches element E_k at time t + T_(ik), where t_(ik) is the transmission time. AEM programs are built from element, connection, fire, program and meta commands. A command explicitly specifies its execution time. Multiple commands can simultaneously execute. During AEM program execution, the meta command can self-modify the AEM.
展开▼
