  We provide a characterization of when a countably infinite set of finite sets
contains an infinite sunflower. We also show that the collection of such sets
is Turing equivalent to the set of programs such that whenever the program
converges it returns the code of a program with finite range.
