Optimization (computer science): Difference between revisions
Jump to navigation
Jump to search
imported>Nick Johnson m (what --> that) |
imported>Nick Johnson m (added categories) |
||
| Line 1: | Line 1: | ||
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|non-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|non-halting]] inputs to P, P' will produce the same outputs. | ||
== See Also == | == See Also == | ||
| Line 5: | Line 5: | ||
* [[compiler]] | * [[compiler]] | ||
* [[List of Compiler Optimizations]] | * [[List of Compiler Optimizations]] | ||
[[Category:Computers Workgroup]] | |||
[[Category:CZ_Live]] | |||
Revision as of 13:32, 11 April 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 non-halting inputs to P, P' will produce the same outputs.