bentonkek
Re:Show HN: NanoMuse – An open-source AI agent for your phone and comp...
on Wednesday October 07, 2026 @10:28AM (#49993363)
Could you elaborate on how you use Hermes for symptom management? I'm especially interested in what it does that can't be done with the usual AI chatbot or agent.
Re:Notes on OpenAI's new o1 chain-of-thought models
on Friday September 13, 2024 @08:50AM (#41530755)
Copernicus was an exception, not the rule. Would you say everyone else who lived at the time was not 'really' intelligent?
Re:NP-Complete isn't (always) Hard
on Tuesday February 21, 2023 @01:39PM (#34884948)
The same thing applies to undecidable problems. Yes, the halting problem is undecidable in the general case. But most real life programs are expected to always halt, or to repeatedly run a procedure that always halts (event loops, servers).
A trivial way to make sure a program halts is to add an upper bound on how much time it takes to run. A more complex way is using theorem provers. Turing completeness is usually not required for real life programs.