Jisho

×
原始再帰関数
Links
Wikipedia definition
1. Primitive recursive function​The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the total µ-recursive functions (µ-recursive functions are also called partial recursive). The term was coined by Rózsa Péter. In computability theory, primitive recursive functions are a class of functions that form an important building block on the way to a full formalization of computability. These functions are also important in proof theory.
Read “Primitive recursive function” on English Wikipedia
Read “原始再帰関数” on Japanese Wikipedia
Read “Primitive recursive function” on DBpedia

Discussions

to talk about this word.