• DocumentCode
    2181590
  • Title

    Algebras of feasible functions

  • Author

    Gurevich, Yuri

  • fYear
    1983
  • fDate
    7-9 Nov. 1983
  • Firstpage
    210
  • Lastpage
    214
  • Abstract
    What happens if we interpret the syntax of primitive recursive functions in finite domains rather than in the (Platonic) realm of all natural numbers? The answer is somewhat surprising: primitive recursiveness coincides with LOGSPACE computability. Analogously, recursiveness coincides with PTIME computability on finite domains (cf. [Sa]). Inductive definitions for some other complexity classes are discussed too.
  • Keywords
    Algebra; Computer science; Databases; Logic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1983., 24th Annual Symposium on
  • Conference_Location
    Tucson, AZ, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0508-1
  • Type

    conf

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