Which makes sense to a certain extent, because if you want to reduce all of computation to something, "machines" and "mathematics" are both things it reduces to, depending on how you look at it. Everything at its base is lambda calculus, but everything at its base is also machine code and bits in registers.
So far.
I don't have any examples, but my gut tells that it would be much easier to replace the "machine code and bits in registers" part with something else than it would be the lambda calc part.
The former is an implementation detail.
What is computable?
How do we prove that?
How do we compute it?
Is it computable in multiple ways (different algorithms, different kinds of computers, etc.)?
Are there certain advantage to different ways of computing the same thing?
What are the basics of computation (is there a minimal concept of computation that encompasses all of the things that are computable)?
etc.
Inherently, computers can do anything; but humans often have a hard time getting computers to do what they want. What
(i) set of higher-level abstractions (such as files, directories, processes, functions, classes, objects, etc),
(ii) ways of those abstractions interacting with each other, and
(iii) notations for those abstractions
best allow humans to get computers to do what they want, with the minimum of effort?
Our ability to represent the methods of that calculation are extremely primitive. I suppose Lambda calculus is pretty close as are most modern programming languages. Upper and lower bound notation (like big-O) isn't bad as a kind of descriptor, but it's very restrictive in what you can do with it. I've seen certain kinds of state notation that's interesting-ish. But nothing approaches the elegance, flexibility (it's easy to abuse in good ways), extensibility, simplicity and efficiency of math notation (though even that system falls down when doing lots of matrix calculations by hand). But it beats the pants off of any other system I've seen for general mathematics.
Most of the things that we deal with in CS are so big and complex that even diagramming them by hand would take longer than we'd want and require more paper than we have. In math we have some nice symbols to bundle all that complexity up, like pi, or summation, or limit notation. In CS we lack that. Most of the time we try and get by with toy examples, like graphs with half-a-dozen nodes, or small trees only a couple levels deep with different colored lines or some such -- most of it seems to be diagrams and tables...lots and lots and lots of diagrams and tables. Regular Expressions seemed about as close as we ever got to describing something succinctly. Learning how to manipulate graphs just off of the regexes was a very cool experience.
I remember distinctly how frustrated my CS professors were compared to my Mathematics professors when trying to explain some concept on the board. I don't ever recall seeing a nice symbol that represented say, a tree, with some various super or subscripts that succinctly described all of the properties of that tree and the algorithm we were going to be using. Imagine how powerful it would be to write down, with just a few strokes, a short series of symbols that unambiguously defined a red-black tree and a search algorithm that runs in such and such min-time-complexity, max-time-complexity, and average-complexity as just a simple operator! Maybe something as simple as Y(rb) + s(log n, log n, "search term") = [s|earch term] or some such! But alas, I'm just falling back on a slightly bruised mathematic formal notation, not really anything new.
Given how rudimentary the tools are we have to work with, it's amazing how far we've come in so short a time.
The main difference between maths and computer science in this respect, if there is any, is that historically math has a divergent evolutionary path, starting as one discipline and spinning off subsystems, while computer science has a convergent evolutionary path, starting from the very different folds of math and electrical engineering and incrementally bringing the two sides closer together. Computational theory and formal verfication belong on the math side, compilers on the engineering side (Haskell being used in production code may be the final merging).
However, just reading the disclaimers of liability that routinely accompany software bear witness to how far software engineering lies from the "established branches of engineering." No Engineer worth his salt in another Engineering discipline would ever dream of getting away with such a disclaimer! As such the field has been hijacked somewhere along the line away from Engineering:)
as others have noted: in europe "computer science" is not taught at universities. informatik is. (one could argue wether the courses "fachhochschulen" offer teach "computer science").
reading what lectures in computer science (in the US) are about, it seems "computer science" is really a lot about computers and writing software. whereas informatics ("informatiker") do not necessarly work with computers - often they do, because computers are handy for working with information. but the computer itself, its software & hardware, how it works is not a part of all informatik studies (it is of some).
i'm no native english speaker but from what wikipedia tells me "informatics" - this very broad field - is actually what we mean with "informatik". for example at the technical university of vienna there are eight different, specific sub-disciplines you can do your master's degree in ("media informatics", "medical informatics", "software informatiks", "technical informatiks", "computer graphics" - my own translations, sorry).
The idea of "math" you get in school is not wrong, but very incomplete. "Experimental math" is a perfectly valid field of study; mathematics itself proved it, about a hundred years ago. Theories are made, predictions are given, and there's no way to prove or disprove them until the experiment is run, at which point you still only have evidence, not proof (in general); sounds pretty scientific to me.
All of these things depend on math. But they go beyond the scope of math because they deal with the realities of designing and building systems for computation. Physics also relies on math, but I've never seen anyone make the reductionist statement "Physics is a branch of mathematics."
Really? I'm currently designing and implementing a programming language, and I haven't (consciously, at least) used any maths concepts more complex than arithmetic.
I like "informatics" though. It is used in "bioinformatics", at least.
Computer science is no more about computers than astronomy is about telescopes.
There's a reason computer science doesn't belong to the art departments in universities.