• DocumentCode
    3623378
  • Title

    Parallel computable higher type functionals

  • Author

    P. Clote;A. Ignjatovic;B. Kapron

  • Author_Institution
    Dept. of Comput. Sci., Boston Coll., Chestnut Hill, MA, USA
  • fYear
    1993
  • Firstpage
    72
  • Lastpage
    81
  • Abstract
    The primary aim of this paper is to introduce higher type analogues of some familiar parallel complexity classes, and to show that these higher type classes can be characterised in significantly different ways. Recursion-theoretic, proof-theoretic and machine-theoretic characterisations are given for various classes, providing evidence of their naturalness.
  • Keywords
    "Concurrent computing","Arithmetic","Turing machines","Calculus","Polynomials","Logic","Educational institutions","Microwave integrated circuits","Computer science","Computational complexity"
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
  • Print_ISBN
    0-8186-4370-6
  • Type

    conf

  • DOI
    10.1109/SFCS.1993.366880
  • Filename
    366880
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3623378