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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Mentioned in
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.