The true minimum meaningful computation is probably the lambda function, anyway.
The true minimum meaningful computation is probably the lambda function, anyway.
But since such things usually suffer from the Turing Tarpit [4], perhaps there's one that has some kind of minimax to be ideally terse and require ideally-few steps for its Turing equivalency, similar to the way that radix 3 (closest to e) has been claimed to have been proven to be the ideally efficient representation system. [5]
(I say "claimed" simply because I recently saw a claim that there's a loophole in the usual reasoning.)
[1] http://en.wikipedia.org/wiki/%C5%81ukasiewicz_logic#Real-val...
[2] https://en.wikipedia.org/wiki/One-instruction_set_computer
[3] https://en.wikipedia.org/wiki/Semi-Thue_system