| 单词 |
blank tape halting problem |
| 释义 |
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. |
| 随便看 |
- december 20, 2014
- december 20, 2015
- december 20, 2016
- december 20, 2017
- december 20, 2018
- december 20, 2019
- december 20, 2020
- december 20, 2021
- december 20, 2022
- december 20, 2023
- december 20th
- december 21
- december 21, 2011
- december 21, 2012
- december 21, 2013
- december 21, 2014
- december 21, 2015
- december 21, 2016
- december 21, 2017
- december 21, 2018
- december 21, 2019
- december 21, 2020
- december 21, 2021
- december 21, 2022
- december 21, 2023
|