Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Primitive recursive function

Related lectures (29)

Explores recursively defined sets, natural numbers, strings, functions, and propositional logic formulae.

Explores hash table efficiency, total functions in code modeling, and well-founded relations for recursive function termination.

Introduces undecidability in recursive languages and Turing machines, showing languages without algorithmic recognition.

Explores Turing machines, recursive languages, undecidability, and symbol elimination.

Covers Turing machines, recursive languages, undecidability, and infinite executions in computational theory.

Explores Fibonacci numbers, rabbit population growth, and recursively defined functions.

Introduces Pollard's rho method for the discrete log problem and finding collisions efficiently in a cyclic group.

Covers abstract interpretation, fixpoints, control-flow graphs, and program state approximation.

Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.

Explores Turing machines, recursive languages, and decidability in the theory of computation.

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Covers the Amyli language, including abstract syntax, program representation, and operational semantics.

Covers the study of recursive sequences, focusing on convergence and limits.

Explores safe mutation in functional programming through lazy evaluation, object invariants, and efficient caching functions.

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

Explores operational semantics and inductively defined relations in the Amyli language.

Explores concurrency semantics, recursive functions, loops, interleaving modeling, and interpreter verification.

Explores recursion and induction for mathematical proofs through recursive algorithms and functions.

Covers recursively enumerable languages, Turing machines, and the construction of undecidable languages.

Introduces recursively defined functions and demonstrates how to compute values and prove properties using mathematical induction.