单词 |
partial recursive function |
释义 |
partial recursive function partial recursive function[¦pär·shəl rē‚kər·siv ′fəŋk·shən] (mathematics) A function that can be computed by using a Turing machine for some inputs but not necessarily for all inputs. |
随便看 |
- february 26, 2023
- february 26th
- february 27
- february 27, 2011
- february 27, 2012
- february 27, 2013
- february 27, 2014
- february 27, 2015
- february 27, 2016
- february 27, 2017
- february 27, 2018
- february 27, 2019
- february 27, 2020
- february 27, 2021
- february 27, 2022
- february 27, 2023
- february 27th
- february 28
- february 28, 2011
- february 28, 2012
- february 28, 2013
- february 28, 2014
- february 28, 2015
- february 28, 2016
- february 28, 2017
|