We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, conditional information inequalities, and independence implication among random variables, by showing that these problems are undecidable. The proof utilizes a construction inspired Herrmann’s arguments on embedded multivalued database dependencies, studied Dougherty, Freiling Zeger, together ...