Verifying Time Complexity of Turing Machines

Authors

  • David Gajser Inštitut za matematiko, fiziko in mehaniko

Abstract

This paper presents a summary of the doctoral dissertation of the author, which analyzes in detail the following problem. For a function T that maps non-negative integers to non-negative reals, how hard is it to verify whether a given Turing machine runs in time at most T(n)? Is it even possible?

References

D. Gajser. Verifying Time Complexity of Turing Machines. FMF UL, 2015. Thesis also available on ECCC.

D. Gajser. Verifying time complexity of Turing machines. Theor. Comput. Sci., 600: 86 - 97, 2015.

D. Gajser. Verifying whether one-tape Turing machines run in linear time. ECCC, TR15-036, 2015.

G. Pighizzini. Nondeterministic one-tape off-line Turing machines and their time complexity. J. Autom. Lang. Comb., 14(1): 107 - 124, 2009.

Downloads

Published

2016-11-07

How to Cite

Gajser, D. (2016). Verifying Time Complexity of Turing Machines. Informatica, 40(3). Retrieved from https://puffbird.ijs.si/index.php/informatica/article/view/1407

Issue

Vol. 40 No. 3 (2016)

Section

Thesis summary

License

I assign to Informatica, An International Journal of Computing and Informatics ("Journal") the copyright in the manuscript identified above and any additional material (figures, tables, illustrations, software or other information intended for publication) submitted as part of or as a supplement to the manuscript ("Paper") in all forms and media throughout the world, in all languages, for the full term of copyright, effective when and if the article is accepted for publication. This transfer includes the right to reproduce and/or to distribute the Paper to other journals or digital libraries in electronic and online forms and systems.

I understand that I retain the rights to use the pre-prints, off-prints, accepted manuscript and published journal Paper for personal use, scholarly purposes and internal institutional use.

In certain cases, I can ask for retaining the publishing rights of the Paper. The Journal can permit or deny the request for publishing rights, to which I fully agree.

I declare that the submitted Paper is original, has been written by the stated authors and has not been published elsewhere nor is currently being considered for publication by any other journal and will not be submitted for such review while under review by this Journal.  The Paper contains no material that violates proprietary rights of any other person or entity. I have obtained written permission from copyright owners for any excerpts from copyrighted works that are included and have credited the sources in my article. I have informed the co-author(s) of the terms of this publishing agreement.


Copyright ©  Slovenian Society Informatika