blank tape halting problem
blank tape halting problem
[¦blaŋk ′tāp ′hȯl·tiŋ ‚präb·ləm] (computer science)
The problem of finding an algorithm that, for any Turing machine, decides whether the machine eventually stops if it started on an empty tape; it has been proved that no such algorithm exists.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Copyright © 2003-2025 Farlex, Inc
Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.