We konden deze vermelding niet vinden. Er worden benaderende resultaten weergegeven. Controleer je spelling of stel voor deze term aan het woordenboek toe te voegen.
原始再帰的
原始帰納的
Similarly, the U function is primitive recursive.
} f も原始再帰的である。
If integers are encoded by Gödel numbers in a standard way, the arithmetic operations including addition, subtraction, and multiplication are all primitive recursive.
Similarly, if the rationals are represented by Gödel numbers then the field operations are all primitive recursive.
同様に有理数をゲーデル数で表した場合、体の演算は全て原始再帰的である。
In fact, it is difficult to devise a total recursive function that is not primitive recursive, although some are known (see the section on Limitations below).
実際、原始再帰的でない関数を考案するのは難しいが、いくつかの例が知られている(限界の節を参照)。
Both Sudan and Ackermann are credited with discovering total computable functions (termed simply "recursive" in some references) that are not primitive recursive.
Successor function: The 1-ary successor function S, which returns the successor of its argument (see Peano postulates), is primitive recursive.
後者関数(Successor Function): 1 項 の後者関数 S とは、引数の後者 (successor) を返す関数であり(ペアノの公理)、原始再帰的である。
In On the Infinite, David Hilbert hypothesized that the Ackermann function was not primitive recursive, but it was Ackermann, Hilbert's personal secretary and former student, who actually proved the hypothesis in his paper On Hilbert's Construction of the Real Numbers.
Other examples of total recursive but not primitive recursive functions are known: The function that takes m to Ackermann(m, m) is a unary total recursive function that is not primitive recursive.
全域再帰的だが原始再帰的でない関数として、他にも次のような例が知られている: アッカーマン関数の2つの引数に同じ値を与える関数 A (m, m ) は単項全域再帰関数だが原始再帰的ではない。
For instance, the most common characterization of the primitive recursive functions is as the 0 constant and successor function closed under projection, composition and primitive recursion.
For this, it is generally required that each individual proof step can be verified by a primitive recursive function or program, and hence the problem is always decidable.
Certainly the initial functions are intuitively computable (in their very simplicity), and the two operations by which one can create new primitive recursive functions are also very straightforward.
Some examples include the first primitive recursive function that results in complexity, the smallest universal Turing Machine, and the shortest axiom for propositional calculus.
Lab Research Target Our laboratory is studying next generation's design and implementation of system software, such as operating system and network software, by applying programming language technologies, such as Coq, F*, Rust, session types, primitive recursive function.
Er worden alleen voorbeelden gegeven om u te helpen het woord of de woordcombinatie waarop u hebt gezocht, te vertalen. Deze worden niet door ons geselecteerd of gevalideerd en kunnen ongepaste taal bevatten. Wij vragen u melding te maken van voorbeelden die dienen te worden aangepast of verwijderd. Vertalingen met grof of informeel taalgebruik worden meestal rood of oranje gemarkeerd.