scientific article; zbMATH DE number 4004169

zbMATH Open0619.03029MaRDI QIDQ3755445FDOQ3755445

Authors: Cristian S. Calude 

Publication date: 1982

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

algorithmscomputational complexitycomputabilityrecursive functionsr.e. setsAbstract measuresefficiency of programs and languagesGeneral Recursionmachine-independent theoryPrimitive Recursion

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Computational Complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)