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.