Problems in logicHilbert's Entscheidungsproblem.Type inference and type checking for the second-order lambda calculus (or equivalent).Problems about abstract machinesThe halting problem (determining w ...
In computability theory, an undecidable problem is of a type of calculation which requires a yes/no answer, but where there can not possibly be any computer program that always gives the correct answe ...
