Sciweavers

    ENTCS
    2011
    131views more  ENTCS 2011»
    Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
    14 years 10 months ago
    Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
    Download  users.ox.ac.uk
    We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
    Ed Blakey
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.