This is more useful than it sounds, since studying problems themselves can often lead to generalizations ("ah, this is NP-hard") that let you import plug-and-play knowledge ("we shouldn't expect a polynomial time solution").
But yeah when it comes time to implement/simulate, papers that are hand wavey with constants get annoying.
The implementation in fact took less space than their plain English description...
For papers that are deeply abstract and focused on solving a problem of the nature you describe, that's to me very different, and clearly there are papers where you won't get around using maths to communicate the problem well. But at least in the fields I've worked in, those kind of papers are rare exceptions.
I do wish more authors published their source code separately from the actual paper.
This distinction was very obvious when I did the literature survey for my MSc. - the papers with even partial code fragments were uniformly less likely to miss out essential information.
Elementary Strong Functional Programming by D.A. Turner
https://pdfs.semanticscholar.org/b60b/1c2e49ec6f574f220f162c...
http://web.mit.edu/Saltzer/www/publications/rfc/csr-rfc-185....
Unix:
https://people.eecs.berkeley.edu/~brewer/cs262/unix.pdf
or pretty much everything here: http://cseweb.ucsd.edu/classes/fa17/cse221-a/readings.html
CS can be pretty broad.
Most mathematical arguments are actually not formal, in the way a program is a formal language.
In many instances, there are not only ambiguities but errors in the mathematical expression. They only become formalised to an equivalent degree in a system like Isabelle or Coq.
Writing proofs in Isabelle and Coq is essentially the same process as writing highly functional code, and is susceptible to the same arduous process. It's hard because it's a formal language running on a rigid machine.
Programming would be easy if you specified everything in a semi --formal pseudo code, designed to be interpreted by a human mind that can fill in the blanks. This is what most mathematics is.