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

Owner based malware discrimination

References

SHOWING 1-2 OF 2 REFERENCES

On computable numbers, with an application to the Entscheidungsproblem

  • A. Turing
  • Computer Science
    Proc. London Math. Soc.
  • 1937
This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.

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