14-time-complexity

14-time-complexity - Complexity Theory Up to now we...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Complexity Theory Up to now we investigated whether a problem is in principle solvable algorithmically, that is, we asked the question whether a particular language is, Decidable: machine halts on all inputs (total computable functions) Turing-Recognizable: machine loops forever on some inputs (partially computable functions) However, we did not investigate the cost of the computation itself - the amount of resources the computation absorbs (time, space, etc. ) In the following we discuss time complexity and space complexity . Furthermore, we assume that we are dealing with total computable functions, that is, the respective language is decidable. – p. 1/ 7
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Definition: Let M be a deterministic TM that halts on all inputs. The running time or time complexity of M is the function f : N N , where f ( n ) is the maximum number of steps that M uses on any input of length n . If f ( n ) is the running time of M , then we say that M runs in time f ( n ) and that M is an f ( n ) time TM. Customarily we use n to represent the length of the input. Our time complexity analysis is called
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course CSC 544 taught by Professor Staff during the Spring '11 term at Rhode Island.

Page1 / 7

14-time-complexity - Complexity Theory Up to now we...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online