The original paragraphs that should be removed read, in order:
Thanks to Turing, "any algorithm that manipulates a finite set of symbols is considered a computational procedure," Pettey said in an interview via email.
Conversely, anything that cannot be modeled in a Turing Machine could not run on a computer, which is vital information for software design. "If you know that your problem is intractable, and you don't have an exponential amount of time to wait for an answer, then you'd better focus on figuring out a way to find an acceptable alternative instead of wasting time trying to find the actual answer," Pettey said.