General recursive function
id:
general-recursive-function-243-16836506
title:
General recursive function
text:
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function. In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines. The μ-recursive functions are
brand slug:
wiki
category slug:
encyclopedia
description:
One of several equivalent definitions of a computable function
original url:
https://en.wikipedia.org/wiki/General_recursive_function
date created:
date modified:
2023-06-24T14:59:16Z
main entity:
{"identifier":"Q284164","url":"https://www.wikidata.org/entity/Q284164"}
image:
fields total:
13
integrity:
14