User blog comment:Deedlit11/Googology in Magic: the Gathering/@comment-5150073-20130601193137/@comment-1605058-20130601195722

Well, it is Turing-complete, so given large enough decks I guess you can reach any recursive function. I don't know how exactly game works, and if it allows for undbounded combos with unbounded decks, but this seems true.