• DocumentCode
    2766243
  • Title

    On the expressive power of program schemes with sets

  • Author

    Stolboushkin, Alexey P.

  • fYear
    1990
  • fDate
    22-25 Oct 1990
  • Firstpage
    447
  • Lastpage
    455
  • Abstract
    The author considers flow diagrams with sets, which is the class of program schemes equipped with finite sets of different levels, so that FDSet1 is such a class equipped with finite sets, FDSet 2 is such a class equipped with finite sets and finite sets of finite sets, etc. He proves FDSet1 is semi-universal. In particular, in infinite structures FDSet1 is able to define every (generalized) computable function. For finite structures, the halting problem for FDSet1, is decidable, and it is proved that DL(FDSet1) exactly corresponds to the LINEARSPACE complexity class
  • Keywords
    computational complexity; parallel programming; programming theory; FDSet1; LINEARSPACE complexity class; expressive power; finite structures; flow diagrams; infinite structures; parallel programming; program schemes; Computer languages; Concurrent computing; Logic functions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology, 1990. 'Next Decade in Information Technology', Proceedings of the 5th Jerusalem Conference on (Cat. No.90TH0326-9)
  • Conference_Location
    Jerusalem
  • Print_ISBN
    0-8186-2078-1
  • Type

    conf

  • DOI
    10.1109/JCIT.1990.128315
  • Filename
    128315
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2766243