scientific article; zbMATH DE number 3427323

MaRDI QIDQ3214899zbMATH OpenFDO

Authors N. V. Petri

Publication date 1969

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(3)

• Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
• Complexity of algorithms and computations
• A sequence of complexly computable functions

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 Q3214899)