News for hackers. Stuff that matters.
Re:Symbolic Regression is NP-hard by mjburgess on Monday November 14, 2022 @03:24AM (#33591453)
Can you say more about how it's equivalent to the halting problem?
Re:Symbolic Regression is NP-hard by thrown_22 on Monday November 14, 2022 @04:27PM (#33601375)
>In mathematics, Richardson's theorem establishes the undecidability of the equality of real numbers defined by expressions involving integers, π, ln ⁡ 2 , {\displaystyle \ln 2,} and exponential and sine functions. It was proved in 1968 by mathematician and computer scientist Daniel Richardson of the University of Bath.

https://en.wikipedia.org/wiki/Richardson%27s_theorem