arXiv cs.CR·16d agoBeyond the Turing threshold: Productive grammars generate essentially undecidable languages#computability#formal-languages#productive-setsResearch1