scientific article; zbMATH DE number 4004169

MaRDI QIDQ3755445zbMATH OpenFDO

Authors Cristian S. Calude

Publication date 1982

zbMATH Keywords

Abstract measuresalgorithmscomputabilitycomputational complexityefficiency of programs and languagesGeneral Recursionmachine-independent theoryPrimitive Recursionr.e. setsrecursive functions

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Theories of computational complexity
• scientific article; zbMATH DE number 702378
• Classical recursion theory. The theory of functions and sets of natural numbers
• scientific article; zbMATH DE number 3909745
• Theory of computation

Cited in

(6)

• scientific article; zbMATH DE number 3847370 (Why is no real title available?)
• Abstract recursion and intrinsic complexity
• scientific article; zbMATH DE number 1870510 (Why is no real title available?)
• scientific article; zbMATH DE number 2110614 (Why is no real title available?)
• scientific article; zbMATH DE number 1453451 (Why is no real title available?)
• Computational Complexity

This page was built for publication:

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