The main difference between pure math and computer science is that mathematicians assume uncountable sets exist and then use that to prove all sorts of nonsense that are not true in the physical or computable Universe.
Many CS papers, at least in machine learning, state an algorithm in terms of real numbers and use results from real analysis to prove properties of the algorithm.
Given that Cantor’s Diagonal Argument – which demonstrates the existence of uncountable sets – is the technique which underlies Turing’s solution to the Entscheidungsproblem, you might want to re-examine your assumptions.