Turing Impossibility Properties for Stack Machine Programming

Details Turing Impossibility Properties for Stack Machine Programming Turing Impossibility Properties for Stack Machine Programming

Publishing date

2012-01-29

URL

arxiv.org/abs/1201.6028v1

Science

Computer Science

Field

Logic in Computer Science

Additional info

arXiv admin note: substantial text overlap with arXiv:0910.5564

Type

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Turing Impossibility Properties for Stack Machine Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Turing Impossibility Properties for Stack Machine Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turing Impossibility Properties for Stack Machine Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379151