General Recursive Functions

DOI10.2307/2031973zbMath0041.15101OpenAlexW4252376252MaRDI QIDQ5801336

Julia Robinson

Publication date: 1950

Full work available at URL: https://doi.org/10.2307/2031973

zbMATH Keywords

Philosophy and foundations of mathematics

Related Items (19)

Definitional schemes for primitive recursive and computable functions ⋮ On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions ⋮ Turing completeness of water computing ⋮ Primitive iteration and unary functions ⋮ Generation of invertible functions ⋮ Computable stack functions for semantics of stack programs ⋮ Finite Generation of Recursively Enumerable Sets ⋮ General iteration and unary functions ⋮ Iteration on notation and unary functions ⋮ A class of recursive permutations which is primitive recursive complete ⋮ Persistent Computations of Turing Machines ⋮ Function operators spanning the arithmetical and the polynomial hierarchy ⋮ A grammar of functions ⋮ A grammar of functions. II ⋮ A Groupoid of Isomorphic Data Transformations ⋮ Bases for algebras of recursive functions ⋮ On the representation of partial recursive functions as superpositions ⋮ Bases in algebras of partially recursive functions ⋮ Closure functions and general iterates as reflectors

This page was built for publication: General Recursive Functions