5 ms·
What do you mean by "difficult" here? Do esoteric programming languages like Malbolge[1] count? "Hello World" in Malbolge: ('&%:9]!~}|z2Vxwv-,POqponl$Hjig
by rustc 13y ago
What do you mean by "difficult" here? Do esoteric programming languages like Malbolge[1] count?
"Hello World" in Malbolge:
('&%:9]!~}|z2Vxwv-,POqponl$Hjig%eB@@>a=<M:9[p6tsl1TS/
QlOj)L(I&%$""Z~AA@UZ=RvttT`R5P3m0LEDh,T*?(b&`$#87[}{W
[1]: http://en.wikipedia.org/wiki/Malbolge http://en.wikipedia.org/wiki/Malbolge
- redxblood 13y agoWell, i was thinking more of a "difficulty in learning" kind. And yes, every programming language count. The point is to see which one would take the longest for someone to feel comfortable with.
- rustc 13y agoI'm pretty sure Malbolge would take a lot of time to become comfortable with. :)
- nithinbekal 13y agoIf we're considering esoteric languages, Brainfuck would probably win. :) "Hello World" in Brainfuck: ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.
- jlebron2 13y agoI second Brainfuck
- oconnor0 13y agoBrainfuck is fairly simple & regular. Malbolge is not; that would make it far more difficult.
- Someone 13y agoThat depends a bit on how one measures difficulty. Brainfuck is hard to read only because its operators are so limited, and is not that hard to write; for a Turing machine, it is fairly powerful, and it has [ and ] to jump around. Intercal, IMO, is more difficult, but it would not be that hard to improve on it. For example, one could bring back the joy of delay line memory (http://en.wikipedia.org/wiki/Delay_line_memory http://en.wikipedia.org/wiki/Delay_line_memory) by having some metric for the complexity of a statement, and having the computer skip some statements depending on that complexity. Ideally (for the goal of complicating the language), the complexity of a statement would depend on the runtime values of variables. For example, 'A = B * C' is easy when C=10, a bit harder when it is 11, and harder still when C=13, unless, of course, B equals zero or one. Similarly, 'IF A > 7' is easy when A is <= 3 or >= 20, but hard for intermediate values. Of course, a true language would not use such simple notions of complexity. The complexity of 'A = B * C' should also depend on the number of binary carries (better yet, use a mixed-base number system), and, of course, the delay of 'OUTPUT X' depends not only on the length of X, but also on the question whether this flushes the output buffer. And, of course, the only way of control flow should be something like Cobol's ALTER, all statements should be executed probabilistically, and the language should be a funge in some weird topology (while at it, change the topology when certain conditions apply (number of statements executed modulo 34567 equals 325, number of 1 bits in variable memory is a prime, it's Monday morning, but not a full moon, etc)
- yoklov 13y agoWriting a reasonable program in Brainfuck isn't that hard. Malborge, on the other hand, was specifically designed to be impossible to write useful programs in. IIRC, Brainfuck was designed to be easy to write a compiler for. From the wikipedia article linked above: "Malbolge was so difficult to understand when it arrived that it took two years for the first Malbolge program to appear. The first Malbolge program was not written by a human being, it was generated by a beam search algorithm designed by Andrew Cooke and implemented in Lisp"... "A correct 99 Bottles of Beer program, which deals with non-trivial loops and conditions, was not announced for seven years".