scientific article
From MaRDI portal
Publication:3735698
zbMath0601.03016MaRDI QIDQ3735698
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
entropycapacitylower boundTuring machine computationscomplexity measureconvolution of infinite digraphsstrucual aspects of computabilitytree of computations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (1)
This page was built for publication: