>>12082776to add
im pretty sure computer scientists don't actually use the term "infinitely fast" for this reason. they use terms like "a program is run on a machine with infinite memory and the program is allowed to execute for infinite time"
i think technically an infinite loop run on a computer with infinite memory and given infinite time would be computable though im not sure. cause technically an algorithm is supposed to end to be considered effective. if each loop of the infinite loop had a nested infinite loop, it'd be for sure incomputable.