3 ms·
Location: U.S. Remote: Yes Willing to relocate: For ideal opportunities, yes. Technologies: Turing Machine approximations. Resume/CV: On Request Email
by ethanwillis 4y ago
Location: U.S.
Remote: Yes
Willing to relocate: For ideal opportunities, yes.
Technologies: Turing Machine approximations.
Resume/CV: On Request
Email: elwillis1 on gmail
Questions for your team (Choose one or more):
1. How many possible 128x128 1 bit color bitmaps exist? Follow up: How can you traverse this state space to generate output meaningful to a human?
2. Which letters can you remove from the English language where it's still readable without ambiguity? Follow up question(s): What's the smallest representation of the English language where it's still readable without ambiguity?
3. In what case(s) is a loop required to be unbounded (in any programming language)?
4. How many programs can be implemented in 10,000 bytes or less? Follow up: How many programs can be implemented in exactly 1000 bytes, 2000 bytes, ..., 10,000 bytes?
If interested, ask me how these questions map onto practical real world problems and/or submit answers so we can have a discussion.