In theoretical computer science, we classify problems according to their Turing degree. Is there any practical application of this? Edit: Given that we cannot explicitly and mechanically understand ...
Coding is obviously a fundamental tool in reverse mathematics, and practitioners take care to both demonstrate the correctness of their coding mechanisms and point out their limitations. Harvey ...
Apologies if my question seems overly naive, but I haven't seen/heard/read any good answers. What is modern computability theory "really" about? The study of feasible(even remotely feasible) ...
There are collections too big to be a set, e.g. the collection of all sets (in ZFC), and there are collections that cannot be sets for "pure" logical reasons, e.g. the collection of sets that do not ...
There are nonequivalent geometries, nonequivalent groups finite and infinite, nonequivalent logics ( fregean and nofregean http://www.formalontology.it/suszkor.htm), even nonequivalent logicians;-) ...
Church's thesis states that the Turing machine is a universal model of computation. What is the most compelling argument supporting this assertion?