Search for Author All Reviews
	Gajser, David     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       Verifying time complexity of Turing machines Gajser D. Theoretical Computer Science 600(C): 86-97, 2015.  Type: Article For any function T, consider the following decision problem HALTT: does a given Turing machine M run in time at most T(n)? More g...... Dec 8 2015
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy