Turing Impossibility Properties for Stack Machine Programming

Authors
Publication date 2012
Number of pages 17
Publisher Ithaca, NY: ArXiv
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract The strong, intermediate, and weak Turing impossibility properties are introduced. Some facts concerning Turing impossibility for stack machine programming are trivially adapted from previous work. Several intriguing questions are raised about the Turing impossibility properties concerning different method interfaces for stack machine programming.
Document type Working paper
Language English
Published at http://arxiv.org/abs/1201.6028
Downloads
Turing_Impossibility_Properties.pdf (Final published version)
Permalink to this page
Back