I’m not sure I understand. I do explain what can be computed, don’t I?

> Something is said to be "computable" if there exists an algorithm that can get from the given input to the expected output. For example, adding together 2 integers is computable.

I could probably have dug into some of the restrictions, like how it has to be a finite number of steps.

This defines the term “computable”, but it doesn’t give you a sense of what things can be computed. Defining a term is entirely different from the above promise.

At the level you’re describing Turing machines, it’s also not clear that readers would have a precise notion of what an algorithm is. At no point (unless I missed it) do you explain that any algorithm is supposed to be implementable as a Turing machine, or the assumption of what is otherwise known as the Church–Turing thesis.

That’s true, there’s no explicit definition of what an algorithm is. I may revisit this. Thank you for the feedback.