2 ms·
Registers? You were lucky! Last time i did an interview problem with a weird machine, i didn't have any registers at all! And only three instructions, none of w
by twic 10y ago
Registers? You were lucky! Last time i did an interview problem with a weird machine, i didn't have any registers at all! And only three instructions, none of which were arithmetic!
- eli_gottlieb 10y agoBy the end the interviewer was telling it was all right for me to have mistakenly thought the registers were 32-bit words, and thus concluded the machine wasn't quite Turing-complete, and he was noting that our analysis should still work for the Turing-complete version with bignum registers.