Sciweavers

    68
    Voted
    MFCS
    2004
    Springer
    117views Theoretical Computer Science» more  MFCS 2004»
    Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
    15 years 2 months ago
    Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
    Download  www.cs.uwyo.edu
    We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
    John M. Hitchcock, María López-Vald&...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.