> I am a secondary school student who has recently observed that many languages sometimes profess themselves as "God's programming language" (e.g. Lisp, C, and other inane functional ones). This appalls me in ways that are ineffable; even the irreligious among us know what the good book says about worshiping false gods.
7
> Technically, I suppose, this is not worshiping false gods, but rather people indulging in false prophets. Nevertheless, it is still immensely painful for me to see people mired in the defilements of the programming world in this manner.
> To ameliorate the wickedness I see in the constructs used by most programmers, I created Genesis, an interpreted Turing-complete Paleo-Hebrew programming language based on a procedural paradigm. There are no objects because object worship is explicitly forbidden in the Bible. There are also no Hindu-Arabic numerals (sinful). Instead, you define all variables using Gematria (Jewish isopsephy).
> I should warn you: the interpreter is extraordinarily enigmatic (and probably buggy), but that is simply the price you have to pay for salvation.
> Please let me know your thoughts about this endeavor. If you would like to give advice or make a pull request to make this language even holier, I am eager for it. To recap the discussion I posted on the GitHub repository, some future features might include:
* An integrated calculus/bioinformatics library. * A command-line tool. * Removing all numbers. * No garbage collection. * "Nothing is covered up that will not be revealed, or hidden that will not be known. Therefore whatever you have said in the dark shall be heard in the light, and what you have whispered in private rooms shall be proclaimed on the housetops." (Luke 12:3) * No I/O. * Introducing more ambiguity.
All permutations of range from \$1\$ to \$n\$
code-golf
Given a positive input \$n\$, output all permutations of either \$\{0,1,\ldots,n\}\$ or \$\{1,2,\ldots,n\}\$.
Examples
Outputting permutations of \$\{1,2,\ldots,n\}\$.
Input|Output
-|-
1|[(1)]
2|[(1, 2), (2, 1)]
4|[(1, 2, 3, 4), (1, 2, 4, 3)...
Imagine I have x numbers chosen uniformly at random from [0, 1]. x is an integer chosen uniformly at random from 1to 10. Now imagine that I look between 0 and 0.1 and there are no numbers in that range. What is the probability that x = 10?
NPSP is going to be down for a while, sorry. It seems that SE has made some major, possibly unintentional, changes to how some things work, and so I'm going to wait a little while to see if they get reverted, then it'll be a lengthy process to get everything working again if they don't.
the currently running version is in python cuz the JS one stopped working, for the same reason NP/SP no longer works, since i mostly followed how your bot did authentication and then combined that with how chatbot.py did event handling
@Steffan Could you post the unminimized version of your Cryptic Multiplication answer? (I assume you didn't work on it in this form -- at least, I hope not...)
