Additional Key Words and Phrases: decision tables, program length, programming efficiency, complexity of algorithms, maximal set, strongly inseparable sets, theory of computability, programs, algorithms, recursive functions
Selected references
- Manuel Blum. On the size of machines. Information and Control, 11(3):257-265, September 1967.
- Albert R. Meyer. Program size in restricted programming languages. Information and Control, 21(4):382-394, November 1972.
- David Pager. On the problem of finding minimal programs for tables. Information and Control, 14(6):550-554, June 1969.
- David Pager. On the efficiency of algorithms. Journal of the ACM, 17(4):708-714, October 1970.
- Hao Wang. A variant to Turing's theory of computing machines. Journal of the ACM, 4(1):63-92, January 1957.
- Paul D. Young. A note on ``axioms'' for computational complexity and computation of finite functions. Information and Control, 19(5):377-386, December 1971.