Turing Impossibility Properties for Stack Machine Programming
Logic in Computer Science
2012-01-31 v1
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.
Keywords
Cite
@article{arxiv.1201.6028,
title = {Turing Impossibility Properties for Stack Machine Programming},
author = {J. A. Bergstra and C. A. Middelburg},
journal= {arXiv preprint arXiv:1201.6028},
year = {2012}
}
Comments
arXiv admin note: substantial text overlap with arXiv:0910.5564