We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Talk:Difficult
Jump to navigation
Jump to search
Missing: SKI combinators, Graph re-writing, automata rule specification, multi-dimensional fungeness, instruction encipherment/encryption, interpreter or code self modification? Salpynx (talk) 19:35, 29 January 2019 (UTC)
- Yes, yes! I’d also suggest typeclasses, dynamic macros (one can create them at runtime), computable real numbers (preferrably all five or something kinds of them), stochastic grammars (context-free at the least), and qubits. —arseniiv (talk) 20:09, 29 January 2019 (UTC)
- Thank you. --A 17:24, 30 January 2019