Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
Work
Year: 2007
Type: article
Source: Theory of Computing Systems
Institutions University of Wyoming, Universidad de Zaragoza
Cites: 36
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 38.72
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Decent work and economic growth
Open Access status: closed