Computational complexity of recursive sequences

Juris Hartmanis, Richard Edwin Stearns. Computational complexity of recursive sequences. In Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 11-13 November 1964, Princeton, New Jersey, USA. pages 82-90, IEEE, 1964.

@inproceedings{HartmanisS64,
  title = {Computational complexity of recursive sequences},
  author = {Juris Hartmanis and Richard Edwin Stearns},
  year = {1964},
  researchr = {https://researchr.org/publication/HartmanisS64},
  cites = {0},
  citedby = {0},
  pages = {82-90},
  booktitle = {Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 11-13 November 1964, Princeton, New Jersey, USA},
  publisher = {IEEE},
}