Final answer:
Finding precise runtime bounds is essential in computer science, particularly for algorithm analysis. While measuring the exact runtime can be complex and may seem redundant in some cases, these bounds offer valuable insights for computational tasks.
Step-by-step explanation:
The statement that precise bounds on runtime are exhausting to find and are kinda meaningless is not universally true or false. It highly depends on the context in which runtime analysis is being performed. In the field of computer science, especially in algorithm analysis, finding precise runtime bounds is critical. It allows understanding how algorithms will scale with input size and helps in the optimization of software. However, measuring the exact runtime can be complex due to factors like hardware differences, operating system scheduling, and other system resource variations.
For some real-world applications, such as high-frequency trading, precise measurements are indeed critical. But for many other applications, although challenging, finding approximate bounds (asymptotic analysis) might be sufficient to understand an algorithm's behavior over large input sizes. Hence, while precision may be difficult and in some cases seem redundant, runtime bounds provide valuable insights for both theoretical and practical purposes in computational tasks.