Cocountability

Basic concepts in infinite set theory

In mathematics, a cocountable subset of a set X is a subset Y whose complement in X is a countable set. In other words, Y contains all but countably many elements of X. Since the rational numbers are a countable subset of the reals, for example, the irrational numbers are a cocountable subset of the reals. If the complement is finite, then one says Y is cofinite. (Wikipedia).

WebAssembly: The What, Why and How

WebAssembly is a portable, size, and load-time efficient binary format for the web. It is an emerging standard being developed in the WebAssembly community group, and supported by multiple browser vendors. This talk details what WebAssembly is, the problems it is trying to solve, exciting

From playlist Talks