Quantitative and qualitative information in computations

DOI10.1016/S0019-9958(80)90615-4MaRDI QIDQ3907071zbMATH OpenFDO

Authors Robert P. Daley

Publication date 1980

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(80)90615-4

zbMATH Keywords

characteristic sequences of setsdegree of unsolvabilityinformation contentminimal-program complexity

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17)

This page was built for publication: Quantitative and qualitative information in computations

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