A note on recursive functions

DOI10.1017/S0960129500000918MaRDI QIDQ4882495zbMATH OpenOpenAlexFDO

Authors Sebastiano Vigna, N. Sabadini, R. F. C. Walters

Publication date 16 June 1996

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129500000918

zbMATH Keywords

computable functionsrecursive functionsconcurrent programming languagecountably extensive categorydistributive graph

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Eine Rekursive Universelle Funktion Für Die Primitiv-Rekursiven Funktionen
• scientific article; zbMATH DE number 3885307
• scientific article; zbMATH DE number 2037780
• scientific article; zbMATH DE number 3944108
• scientific article; zbMATH DE number 926976

Cites work

• An existence theorem for recursion categories
• Can programming be liberated from the von Neumann style?
• Introduction to extensive and distributive categories

Cited in

(8)

• A curious recursive function
• Recursive functions: an archeological look
• An algebra of automata that includes both classical and quantum entities
• scientific article; zbMATH DE number 1261165 (Why is no real title available?)
• Design of recursive programs for calculating periodically defined functions over finitely defined data structures
• scientific article; zbMATH DE number 3885307 (Why is no real title available?)
• On the relations between distributive computability and the BSS model
• Feedback, trace and fixed-point semantics

This page was built for publication: A note on recursive functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882495)