> shits on CS majors > can't even show that the intersection

>>9070350
>that SJW hair
but why?

I'd bet a fortune that more math majors could prove this than CS majors

>implying CS undergrads are taught recursion theory

>>9070350
Ahem, {{}}

>>9070350

Assume A and B are recursively enumerable and coinfinite but A∩B is not hyper-simple. So there is a computable function f such that, for all n, the nth element of the complement of A∩B is less than f(n). Consider the recursively enumerable set S of all n such that the nth element of the complement of A is not less than f(2n−1). If S is finite, then a finite variation of f(2n − 1) witnesses that A is not hyper-simple. So assume that S is infinite. For n ∈ S, there are at least n elements in the complement of B less than f(2n−1). Define a computable function g as follows. To compute g(m), find n ∈ S with n ≥ m and let g(m) = f(2n−1). Then g witnesses that B is not hyper-simple.

>>9070350
>clearly buttmad about engineers and math majors shitting on them
>comes here with some dumb proof nobody cares about
>can't even write it in latex
good thread