Re:Tree Calculus
by froh on Friday April 10, 2026 @01:20AM
(#47713954)
is theoretical computer science (turing machines and automata theory, lambda calculus, complexity theory, computability, devidability, etc) pure maths? or applied maths indeed?
tree calculus is theoretical computer science for sure.
and that, computer science, in its beginnings at least, until the 1950s or so, was a field of mathematics, like algebra, or analysis or logic. all of which have pure maths parts and applied maths parts, don't they?
long story short, I don't think theoretical computer science is "applied maths", it to the contrary can be deep in pure maths land.
tree calculus is theoretical computer science for sure.
and that, computer science, in its beginnings at least, until the 1950s or so, was a field of mathematics, like algebra, or analysis or logic. all of which have pure maths parts and applied maths parts, don't they?
long story short, I don't think theoretical computer science is "applied maths", it to the contrary can be deep in pure maths land.