scientific article; zbMATH DE number 3968573

MaRDI QIDQ3735698zbMATH OpenFDO

Authors Stasys Jukna

Publication date 1986

zbMATH Keywords

entropycapacitylower boundTuring machine computationscomplexity measureconvolution of infinite digraphsstrucual aspects of computabilitytree of computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Complexity of computation (including implicit computational complexity) (03D15) Algorithms in computer science (68W99) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 4002123
• Publication:3033329
• Computability of the entropy of one-tape Turing machines
• Entropy of contact circuits and lower bounds on their complexity
• Kolmogorov entropy in the context of computability theory

Cited in

(2)

• Exact complexity: the spectral decomposition of intrinsic computation
• Entropy of contact circuits and lower bounds on their 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 Q3735698)