Functions computable by a computer

DOI10.1007/BF02282547MaRDI QIDQ2558001zbMATH OpenFDO

Authors A. Schurmann

Publication date 1971

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02282547

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Computability and recursion theory (03D99) General topics in the theory of software (68N01) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cites work

• A Theory of Computer Instructions
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3388987 (Why is no real title available?)
• On the definition of computable functionals
• The application of graphs to the analysis of distribution of loops in a program

This page was built for publication: Functions computable by a computer

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