Paper Info
Title
Turing Impossibility Properties for Stack Machine Programming
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.
Year
Venue
Field
2012
CoRR
Probabilistic Turing machine,Universal Turing machine,Computer science,Super-recursive algorithm,Algorithm,Theoretical computer science,Description number,Turing machine,Multitape Turing machine,Turing machine examples,Non-deterministic Turing machine
DocType
Volume
Citations 
Journal
abs/1201.6028
0
PageRank 
References 
Authors
0.34
3
2
Name
Order
Citations
PageRank
Jan A. Bergstra11946240.42
Cornelis A. Middelburg248749.21