The Strength of Non-size-increasing Computation (Introduction and Summary)

Martin Hofmann. The Strength of Non-size-increasing Computation (Introduction and Summary). In Jiri Sgall, Ales Pultr, Petr Kolman, editors, Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Volume 2136 of Lecture Notes in Computer Science, pages 58-61, Springer, 2001. [doi]

@inproceedings{Hofmann01:0,
  title = {The Strength of Non-size-increasing Computation (Introduction and Summary)},
  author = {Martin Hofmann},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2136/21360058.htm},
  researchr = {https://researchr.org/publication/Hofmann01%3A0},
  cites = {0},
  citedby = {0},
  pages = {58-61},
  booktitle = {Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings},
  editor = {Jiri Sgall and Ales Pultr and Petr Kolman},
  volume = {2136},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42496-2},
}