n grabs the next number it can from the input, dropping non-numeric characters as needed. I assume the downvote is for being incorrect in the case of 10P0. — El'endia Starman39 secs ago
Hold on, I'm confused. The Wikipedia page has P(n,k) = n(n-1)(n-2)...(n-k+1). If k=0, then that is P(n,0) = n(n-1). Which would mean my program is working correctly. But that just seems wrong...
If it's repeated you can try taking every nth character and seeing which numbers you can xor with such that all the nth characters turn into printable ASCII/newlines (assuming the final message is all printable ASCII/newlines)
Often, answers to questions asking for "programs" or talking about "programming languages" utilize things like sed, awk, … in order to get around having to write an actual shell script.
Therefore, a question comes to my mind:
What qualifies as a programming language?
Sure, ultimately the OP ca...
You saved the day with your prime sequence code, and the math teacher loved it. So much so that a new challenge was posed to the librarian (a/k/a, your boss). Congratulations, you get to code the solution so the librarian can once again impress the math teacher.
Start with the sequence of natura...
As in, $( in Minkolang pops n and starts a while loop with with the top n elements of the stack. k breaks out of a loop, so I can do that if I want to restrict my operations to a subset of the stack.
I'm assuming there are 2 possibilites: 1) XORed using a repeating piece of binary, like a vigenere cipher. 2) XORed using a small piece of ACII text converted to binary
And the code's just what I said before (link) - try taking every nth character and see which numbers in [0, 255] you can XOR with to get just printable ASCII
and I spent about 3 hours trying to decode it in the binary form, lol
Thanks again
The next challenge is RSA, I'll be going for it probably a few days later. At least now I know there is a chatroom that I can always count on to help me with encryption stuff =]
At some point in the future, I do want to develop Son of Minkolang, where I use the characters available in the "ANSI" encoding (so, most of 129-255) and I also add the ability to have full lists and strings on the stack.
We already have a question about default I/O for general code-golf submissions. However, entries in machine code have different built-in I/O capabilities from entries in high-level languages. Should they be allowed by default to input/output differently?
In this question, consider a machine code...
Something like Rotor will probably be the next generation of golfing languages. With these one-character-command languages, the logical next step in getting the size of programs down as close to their entropy as possible is to make commands that are likely to be used next smaller.
The next good language will probably also have many, many 2- and 3-byte builtins
Or you could take my $ concept, where it toggles the functionality of the next command and add more symbols that do the same thing, but different toggles. Similar to switching wheels, but it would jump to that wheel (so you don't have to do like >>> to go three wheels to the right).
Could use an idea like Huffman coding to pick which ones should go on more frequent wheels.
Hmm. To really get the top best most optimal golfing language, we'd probably have to get a significant portion of PPCG's top golfers to discuss commonly-used strategies and algorithms and prioritize those.
Surely making a language where everything is a valid program is the way to go. i.e. enumerate all non-runtime-erroring Cjam programs over the integers in base 256 to form a new language.
@El'endiaStarman Say that 30 of the 95 printable ascii single character cjam program have errors (I don't know how many really error, just an example). In cjam these 30 strings are invalid programs that will never run, so they could be mapped to longer programs that do run. Hence you save space.
You'd need to assume a finite alphabet of characters of course. Printable-ascii or whatever. But enumerate them by listing all 0 char programs, then all 1 chars, thn all 2, etc
What I've thought before, is if I were to try to make a shortest language, it would be processed as a bit stream. It would be a series of indices into an array of instructions. After each instructions, the order of the array would change based on what's most likely to come next.
What's the weather like?
Pick six cities, one from each of the populated continents, Asia, Africa, North America, South America, Europe and Australia.
Make a table where the weather for each of the cities are listed, for the coming ten 6-hour periods. The cities should be listed in the order ab...
If we're going by the criteria of "don't assign this program to this code if it can be beaten by some other language" then that's an entirely different question altogether
I'm actually mulling over the theorem prover idea.
You can watch the state of a program (for Minkolang, that'd be code, cursor position, cursor velocity, loops and stacks, and array) for any repeats. If you have a repeat, it's very likely an infinite loop.
It'd be cool if we could manage to enumerate and describe all Hexagony programs with at most 7 chars.
ShapeScript, 57 bytes
"2"@+0?1'@"20"$"3"~"21"$"3"~"3"$"2"~@1?3?<1<*'3?_2-*!@#@#
What's the weather like?
Pick six cities, one from each of the populated continents, Asia, Africa, North America, South America, Europe and Australia.
Make a table where the weather for each of the cities are listed, for the coming ten 6-hour periods. The cities should be listed in the order ab...
