A note on turing machine computability of rule driven systems

@article{Kantorovitz2005ANO,
  title={A note on turing machine computability of rule driven systems},
  author={Isaiah Pinchas Kantorovitz},
  journal={SIGACT News},
  year={2005},
  volume={36},
  pages={109-110}
}
An abstract rule driven system is described. We prove that it is calculated by a restricted Turing Machine. 
1 Citations

Topics from this paper

Owner based malware discrimination
TLDR
This paper proposes an owner based malicious software discrimination model, named as Unlimited Register Machine of Owners (URMO), and applies the model to discriminate real-world malware and comparing it with existing popular antivirus software to demonstrate the effectiveness and superior performance of the model. Expand

References

SHOWING 1-2 OF 2 REFERENCES
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand
On computable numbers, with an application to the Entsceidungsproblem Proc. London Math. Soc., ser. 2 vol
  • On computable numbers, with an application to the Entsceidungsproblem Proc. London Math. Soc., ser. 2 vol