I am considering posting the following puzzle. I'm aware that there's been a lot of discussion about what makes a high-quality math puzzle, as opposed to a an off-topic math problem, and I'm not sure whether the question would be on-topic or not. Can you please tell me whether this potential puzzle would be acceptable?
Two angels in heaven want to play a game. One of them comes up with an arbitrary, computable function from the integers to the integers. The other angel has to guess what it is. The second angel can either give an integer, which the first angel gives an input to their function and responds with the output, or a computable function, which the first angel says is either correct or incorrect. The game continues until the second angel guesses the function.
The angels only want to play the game if they know it will end. It doesn't matter how long it takes because since they're in heaven, they'll have an infinite amount of time to do other things whenever the game ends. However, if the game will never end, the angels don't want to play the game. Should they play it? If they should, what is the smallest number of integers the second angel will need to check to be sure of eventually guessing the correct function?
I do know the solution to the question, although I won't post it here (unless you believe it is relevant).