turing-machine

Ejecución de Código Arbitrario en la Máquina de Turing Universal Esta es una implementación de la Máquina de Turing Universal como se presenta en Minsky, Computation: Finite and infinite machines, 1967, Capítulo 7. La entrada predeterminada a la máquina simulada es un exploit que logra la ejecuci...

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

Input validation

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

CVE-2021-32471

CVE-2021-32471 concerns the Marvin Minsky 1967 Universal Turing Machine implementation, where insufficient input validation in the program allows a user to execute arbitrary code via crafted data. The described scenario notes that, after processing input composed of As and Bs (rather than 0s and ...

CVE-2021-32471

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...

Universal Turing Machine Marvin Minsky 输入验证错误漏洞

Universal Turing Machine is a computational model. Provides a simulation of any Turing Machine function on any input. A security vulnerability exists in Universal Turing Machine Marvin Minsky 1967. The vulnerability stems from insufficient validation of user input by the program, which could allo...

CVE-2021-32471: Improper Input Validation

Insufficient input validation in the Marvin Minsky 1967 implementation of the Universal Turing Machine allows program users to execute arbitrary code via crafted data. For example, a tape head may have an unexpected location after the processing of input composed of As and Bs instead of 0s and 1s...