Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Primitive Recursive Function
CHF 49.40
Auf Lager
SKU
UE5SJDNL2FE
1 Verfügbar 
Geliefert zwischen Fr., 23.01.2026 und Mo., 26.01.2026
Details
High Quality Content by WIKIPEDIA articles! The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions. The term was coined by Rózsa Péter. In computability theory, primitive recursive functions are a class of functions which form an important building block on the way to a full formalization of computability. These functions are also important in proof theory. Most of the functions normally studied in number theory are primitive recursive. For example: addition, division, factorial, exponential and the nth prime are all primitive recursive. So are many approximations to real-valued functions. In fact, it is difficult to devise a function that is not primitive recursive, although some are known. The set of primitive recursive functions is known as PR in complexity theory. Every primitive recursive function is a general recursive function.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130341992
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T7mm
- Jahr 2010
- EAN 9786130341992
- Format Fachbuch
- ISBN 978-613-0-34199-2
- Titel Primitive Recursive Function
- Untertitel Primitive Recursive Function, Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number
- Gewicht 185g
- Herausgeber VDM Verlag Dr. Müller e.K.
- Anzahl Seiten 112
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
