Since my Tetris question seems to evade being answered even to this day, I thought I'd create a slightly easier challenge, one that doesn't need any user input.
Your task is to build a Game of Life simulation representing a digital clock, which satisfies the following properties:
The clock d...
@ASCII-only These are correct terms in mathematical language. APL was originally (then known as Iverson Notation) a refinement of maths, not a programming language.
@ZacharyT If it wasn't for the rules they taught you in school, why does 5-1-2 ≡ (5-1)-2 make any more sense than 5-1-2 ≡ 5-(1-2) ?
Well, and there you have it. The order of evaluation of traditional mathematics is so confusing that even clever PPCG users can't agree on simple expressions!
@ZacharyT 1=0÷0 was probably a mistake. In J it doesn't give 1, and Dyalog added an option alter the behaviour. 0 power 0 looks ok to me - can you find a problem with that? No you don't, that's just being silly.
@betseg Iverson didn't start over, he stood on the shoulders of those millennia.
@betseg Just because C is ancient doesn't mean VSL can't ever be faster than it, just because Go is ancient doesn't mean AlphaGo can't revolutionize it
@ZacharyT However, I do agree that IBM made the wrong choice when they had to chose between the two ISO APL standards for reduction: insertion and rank-reduction. They chose the latter, while IPSA chose the former, and we've had to write ⊃ ,/ since.
I just never understood having, say, what you think is a reasonable implementation of a centroid function return [[0,1]] for input [[0,1]], but [[0,1],[0,1]] produces [0,1]
Having an order-of-evaluation becomes untenable as you add more and more functions/operators. Eventually you have to choose LTR or RTL. Iverson chose RTL so that the very common prefix- could stay on the left, but moving the post-fix !, rather than moving - to match !.
Also, RTL lends itself better to English reading order: -3÷2*!x (the negation of three divided by two to the power of the factorial of x) rather than x!*2÷3- (x-factorial, powering two, dividing three, negated).
there was one io game that was actually fun. i don't remember the name. i'll try to explain it if someone knows: it's a grid, you try to claim land, you die if other people eat you while you're trying to claim.
I think that as long as a compiler was released before the question was asked, it is a valid language. This removes stupid answers such as "I created language X with this command Y that solves this in one character".