Stephen Wolfram talks about computational irreducibility and I think of that as essentially the same as the halting problem. I like his description that science

Stephen Wolfram talks about computational irreducibility and I think of that as essentially the same as the halting problem. I like his description that science advances by finding problems that we care about that are also computationally reducible. An equivalent with halting is to find those problems that we care about where halting can be proven (or disproven).