Optimization (computer science): Difference between revisions
Jump to navigation
Jump to search
imported>Nick Johnson (major mistake; replaced non-halting with halting) |
imported>Subpagination Bot m (Add {{subpages}} and remove any categories (details)) |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 1: | Line 1: | ||
{{subpages}} | |||
In [[computer science]], particularly in the study of [[compiler|compilers]], an '''optimization''' is a transformation of computer programs that, when applied to a computer program P, produces an equivalent program P' which is in some way more optimal (i.e. faster, less memory consumption, etc). More formally, equivalent is defined so that for all [[halting problem|halting]] inputs to P, P' will produce the same outputs. | In [[computer science]], particularly in the study of [[compiler|compilers]], an '''optimization''' is a transformation of computer programs that, when applied to a computer program P, produces an equivalent program P' which is in some way more optimal (i.e. faster, less memory consumption, etc). More formally, equivalent is defined so that for all [[halting problem|halting]] inputs to P, P' will produce the same outputs. | ||
== See Also == | == See Also == | ||
* [[ | * [[List_of_code_generation_topics|List of code generation topics]] | ||
* [[List of | * [[List of compiler optimizations]] | ||
Latest revision as of 09:13, 12 November 2007
In computer science, particularly in the study of compilers, an optimization is a transformation of computer programs that, when applied to a computer program P, produces an equivalent program P' which is in some way more optimal (i.e. faster, less memory consumption, etc). More formally, equivalent is defined so that for all halting inputs to P, P' will produce the same outputs.