GorkSorry, can't do scarves.
I’m sad that the relevant xkcd is kinda obsolete now (because it’s been long enough for that research team to finish going its thing).
What would be a “nearly impossible” task in this post-AI world? Short of the provably impossible tasks like the busy beaver problem (and even then, you would be able to make an algorithm that covers a subset of the problem space), I really can’t think of anything.
Still going to be non-deterministic for any commercial AIs offered to us. It’s a weird technology. I had a link to an article explaining why but I can’t find it anymore.
Ah yeah I was wrong. You set top-k to 1 to get a deterministic output.