scientific article; zbMATH DE number 3335016
From MaRDI portal
Publication:5612462
zbMath0211.31101MaRDI QIDQ5612462
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Algebra of constructions. I. The word problem for partial algebras ⋮ Primitive iteration and unary functions ⋮ The first example of a recursive function which is not primitive recursive ⋮ Computable stack functions for semantics of stack programs ⋮ Unnamed Item ⋮ Sequence recursiveness without cylindrification and limited register machines ⋮ In memoriam Calvin C. Elgot ⋮ Unnamed Item ⋮ Characterization of recursively enumerable sets ⋮ General iteration and unary functions ⋮ Succinct iterative characterizations of primitive computable unary functions ⋮ Unnamed Item ⋮ Defining effectiveness using finite sets. A study on computability ⋮ Unnamed Item ⋮ Proving a compiler correct: A simple approach ⋮ Sequence-to-sequence recursiveness ⋮ Introduction to Turing categories ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ Calvin C. Elgot (1922-1980) ⋮ Aspects of Categorical Recursion Theory ⋮ Modular tree transducers ⋮ Closure functions and general iterates as reflectors ⋮ Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
This page was built for publication:
