Mit: >> Universal Turing Machine Security Vulnerabilities
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). NOTE: the discoverer states "this vulnerability has no real-world implications."
CVSS Score
7.8
EPSS Score
0.054
Published
2021-05-10