This is a list of some possible future tasks that we once considered with @traiansf, together with time estimates:

• strong_nontriviliality_full for ELMO. (a few weeks)
• More general proof of strong_nontriviality_full, based on VLSMs. (a few months)
• When do we make which computability assumptions? (no estimate)
• Drop the decidability requirement is_equivocating_dec from the BasicEquivocation class. (at least one month)
• Research infinite (but finitely-supported) composition in which machines can join and leave at any time. (at least one month)
• ELMO suit: add the tracking of message history to an arbitrary VLSM. (at least a couple months)