I still haven't found a good definition of computability. All the definitions are either too vague, or they delegate the definition to another loaded term like "anything that uses math to solve a problem", or "anything that can be solved by a computer". So I came up with my own definition:
"A problem is computable, if both it and its solution, can be reduced to a formal symbolic representation, and there exists a finite number of formally-defined symbolic manipulation steps that can convert the problem to its solution."
Does that make sense, and/or can you come up with a better or modified answer?