Optimization (computer science): Difference between revisions
Jump to navigation
Jump to search
imported>Nick Johnson m (added categories) |
mNo edit summary |
||
| (4 intermediate revisions by 3 users not shown) | |||
| 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| | {{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. | |||
== See Also == | == See Also == | ||
* [[ | * [[List_of_code_generation_topics|List of code generation topics]] | ||
* [[List of | * [[List of compiler optimizations]][[Category:Suggestion Bot Tag]] | ||
[[Category: | |||
Latest revision as of 11:00, 29 September 2024
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.