Geek asks and answers

Turing Full x86 alphanumeric instruction set (subset)

I'm looking to create a minimal, computationally universal subset of the x86 alphanumeric opcode. In the end, I want the subset to contain as few instructions as possible, and if there are a few minimal subsets, I want to know that too. The subset should be able to simulate any program that can be recorded with the entire set of alphanumeric instructions. Instructions should only contain instructions corresponding to the characters "AZ", "az" and "0-9".

I think that would be enough until now push, pop, inc, dec, cmpand je, but I'm sure that there is a smaller set. How can I prove that the set I created is able to simulate any program using all the alphanumeric instructions? How can I prove that such a set is minimal? Does anyone know if such a subset of commands exists?

+5
source share
2 answers

I'm not sure that I have your question, especially the part "alphanumeric", but Id like to point out that it is well known that movand xorcomplete Turing.

+1
source

This is just ONE instruction! here is the proof

http://en.wikipedia.org/wiki/One_instruction_set_computer

? , "" - - . , // : : "" turing - ( ),

0

More articles:


All Articles