Turing Impossibility Properties for Stack Machine Programming
J. A. Bergstra, C. A. Middelburg
TL;DR
This paper introduces various Turing impossibility properties for stack machine programming, exploring fundamental limits and raising questions about different method interfaces.
Contribution
It defines strong, intermediate, and weak Turing impossibility properties and discusses their implications for stack machine programming.
Findings
Some facts are trivially adapted from previous work.
Raises questions about method interfaces and Turing impossibility.
Provides a framework for understanding limits of 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Machine Learning and Algorithms · Optimization and Search Problems