Earlier quoted context omitted.
I’d argue that logic is a subfield of computability theory, and so by extension we (in CS) absorb math.
Like I said, you can indeed construct logic through CS! But you can also obviously construct CS from logic. You can also construct logic through the natural numbers, so number theory absorbs math and by extension CS? Fact is anything reasonably complex can replicate everything else. Exactly one of these fields, however, is specifically carved out as the study of any formal system, and it isn't CS.
There’s more to mathematics than rigour and proofs (2007)
91–95 of 95 posts
Re: There’s more to mathematics than rigour and proofs (2007)
#92Earlier quoted context omitted.
How so? Even a real interval of a finite length cannot be covered by any set of intervals of a smaller total length. (Unless the person you are trying to explain this to starts raising questions about the meaning of 'interval' or 'length', in which case the meaning of the original question becomes just as uncertain in the first place.)
> Even a real interval of a finite length cannot be covered by any set of intervals of a smaller total length. You’ve only restated the problem without saying _why_ covering the reals is different.
Re: There’s more to mathematics than rigour and proofs (2007)
#93Re: There’s more to mathematics than rigour and proofs (2007)
#94Earlier quoted context omitted.
I mean that for any epsilon > 0, you can have a set of intervals of the form (a_i, b_i) where every rational number is in some interval and the sum over all i of b_i - a_i That is, you can cover the rationals with intervals of arbitrarily small total length.
I see. But is that not just a simple conclusion of the fact that the rationals are countable, and that there exists a converging series of positive numbers?