Algorithmic complexity of recursive and inductive algorithms. Burgin, M. Theoretical Computer Science, 317(1-3):31–60, 2004.
Algorithmic complexity of recursive and inductive algorithms [link]Paper  bibtex   
@ARTICLE{Bur04,
  author = {Burgin, Mark},
  title = {Algorithmic complexity of recursive and inductive algorithms},
  journal = {Theoretical Computer Science},
  year = {2004},
  volume = {317},
  pages = {31--60},
  number = {1-3},
  file = {Bur04.pdf:Bur04.pdf:PDF},
  issn = {0304-3975},
  mrclass = {68Q30 (03D10 68Q05)},
  mrnumber = {2074734},
  mrreviewer = {Marius Zimand},
  url = {https://doi.org/10.1016/j.tcs.2003.12.003}
}

Downloads: 0