User talk:a

From Esolang
Jump to: navigation, search

Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: <https://esolangs.org/>. (for the other find of esoterica, try #esoteric in Fnet or ALnet.) -- Hackeso Funny Chef program:

Blaise invented the Pascal Calculators: PASsive CALculator calculators, known as PASCAL. Later Niklaus Wirth created Pascal named after these calculators.

Baking dish plus mixing bowl.

This serves the baking dish and the mixing bowl to the customer on a baking dish.

Ingredients.
1 mixing bowl
1 baking dish

Method.
Put the mixing bowl into the mixing bowl.
Put the baking dish into the mixing bowl.
Pour contents of the mixing bowl into the baking dish.

Serves 1.

There is github.com, and there is bithug.com.

Write some nonsense here

ehird was a genius! They have put two languages into the featured languages, and both of them has got featured!

I see the trend of the extended descriptions on Esolang:Featured languages; the first description was 3 lines, and the last description is 4 lines; that is why I decided to write 5 lines.

I hate brainfuck; it makes this wiki full of its derivatives and many of them are just trivial replaces or extensions of them. This makes the wiki monotonous. I suggest the page and its derivatives to be removed from this wiki.

Challenge: Write a Hello, world! program with the following time complexity: O(O(O(n^(n^n)+O(nlogn)))/(n+nlogn)). Spoiler of the joke: you will soon discover this as trivial, as it will eventually return a contant. You only have to devise an algorithm that is constant time.

Interesting fact: the signature system can actually do infinite looping until it breaks from the loop: try to set your signature like this:
~~~~1
This will try to set the signature to 1 repeating forever until it breaks. Then, it sets the signature to
1
and then stops the loop.

A sentence without using 'e'

  • An IRC bot is an analog program that was built for satisfaction for human control.

A sentence without using 't'

  • An esolang is a programming language made because of odd desires of a language-maker; esolangs could be made weird or as a joke, as opposing a normal programming language.

A sentence without using 'a'

  • In the nondeterministic set, things don't commit the same result in the same event.

Blocked

I've blocked you temporarily for impersonating other users. Using a signature with the same name as another user, and linking to their talk page rather than your own, is likely to confuse people and may accidentally cause the wrong person to be blamed from an action of your own.

On a side note, you shouldn't be trying to direct people away from your user talk page if they want to contact you; the whole point of the page is to allow for discussions to take place, and a wiki relies on discussions between editors to resolve disputes. Being unwilling to collaborate with others (or seeking to test people's boundaries, antagonise them, etc.) is behaviour that is likely to cause a longer ban if it keeps up into the future. --ais523 04:31, 16 July 2019 (UTC)

I also just noticed your pagemove vandalism in userspace. That's another good reason for the temporary block, and if you do something like that it may become permanent. --ais523 04:52, 16 July 2019 (UTC)

Minimal J for Beginners

One of the most difficult problems facing a beginner wanting to learn J is the overwhelming number of language primitives. Someone completely unfamiliar with the language might think that a language whose vocabulary fits on a single page would not present such a problem. However, at least one beginner has expressed bewilderment at where to start when attempting to learn the myriad of basic J operations.

Based on the suggestions from this discussion, here is a reduced instruction set of some of the most useful and commonly-used J verbs, based on my own experience.

Basic J

Where there is a pair of words separated by a dot (•), we are (usually) showing both the monadic (single argument on the right) and dyadic (arguments on both sides of symbol) cases.

Basics Examples (paste into J)
=. Is (local assignment) =: Is (global assignment) loc=. 1 2 GLO=: 'foo'
_ Negative Sign • Infinity NB. Comment _3 = -3 NB. negative vs. negate
'string' Character string '' NB. Empty vector 'Hello, World!'
Arrays
$ Shape Of • Reshape # Tally • Copy 2 2 4 $ 1 2 11 22 1 2 3 # 1 2 3
, Ravel • Append ; Raze / Link , 2 2$99 23 ; 'skidoo'
{. Take }. Drop 3 {. 'foot' 2 }. 1 2 3 4
/ Insert • Table i. Integers • Index of + / 1 10 100 i. 10 'foo' i. 'o'
Math
+ Conjugate • Plus * Signum • Times 2 + 3 30 3 30 * 2
- Negate • Subtract % Reciprocal • Divide 1 10 - 5 6 2 3 5 % 3 4 6
^ Exponential • Power ^. Natural Log • Log 2 ^ i.17 2 10 ^. 4 100  ^. 2.71828
<. Floor • Minimum >. Ceiling • Maximum 2 3 4 <. 99 1 2  >. 1.1 0.5 1.9

Concern

User: A, I was scrolling through the languages you made to see if I could implement them in Erlang, when I came across your latest esolang. Do you know how hard it would be to implement your esolang, your Pillows? In order for the interpreter to find out if a word input as an instruction is a valid dictionary word, it needs to have a entire database of valid words. This database, (even if it just includes the most common words in the English language), would takes months to complete. Areallycoolusername (talk) 22:39, 1 August 2019 (UTC)

This was completed for you if you use Python. --A (talk) 00:04, 2 August 2019 (UTC)

I've just completed the 256 page. I'll make another golfing language, and this time, I'll add more commands and learn two other golfing languages, in order to allow for a more conventional language. Areallycoolusername (talk) 05:04, 4 August 2019 (UTC)

I have created the golfing language, Gulp. It has 128 commands, and I'll make a github repo for it once all the commands have their own function (I'm only done with 35 of them). THen , I'll make a wiki page and use it in CGCC. Areallycoolusername (talk) 12:04, 5 August 2019 (UTC)
I have based it on GolfScript and Husk. Husk is functional, and GolfScript is Stack based. Gulf uses some functional properties, and is stack based. I am now done with 75 of the commands. Areallycoolusername (talk) 13:48, 5 August 2019 (UTC)
Oh my, you finished 40 commands in 1 hour!? (But make sure that it is a programmning language before you use it on CGCC.)--"Kui see sulle ei meeldi, siis ära kasuta seda." -- fishHDR; A (rääkida) 02:16, 3 August 2019 (UTC)
I have finished Gulp, after proofreading the commands several times. I made a repo but its not complete as of yet. Areallycoolusername (talk) 03:23, 7 August 2019 (UTC)
Here is the repo so far. Areallycoolusername (talk) 14:53, 8 August 2019 (UTC)
Is Gulp completely written in the printable ASCII? If so, compressing the program(like in Stax) will make programs shorter. --"Kui see sulle ei meeldi, siis ära kasuta seda." -- fishHDR; A (rääkida) 02:16, 3 August 2019 (UTC) 23:49, 8 August 2019 (UTC)
Gulp is completely written in printable ASCII. However, as I do not know how string compression works, it is not included in the current spec. Could you explain how string compression works? Areallycoolusername (talk) 01:55, 9 August 2019 (UTC)
There are multiple ways to do that, but typically you make a lookup table storing what a character means as a binary string. --"Kui see sulle ei meeldi, siis ära kasuta seda." -- fishHDR; A (rääkida) 02:16, 3 August 2019 (UTC) 05:52, 9 August 2019 (UTC)

Re: Your Comment On My Github Pull Request

On my pull request chat on the ETHproduction golfing language list, you remarked how a language was defined by its implementation, however, I disagreed (You can find the reply on the chat). Looking back at that statement, however, gave me an idea. What if a language were to be created, which would have its spec changed, every time it was implemented differently from the original implementation? That way, the language WOULD be defined by its implementation. What do you think about this? Areallycoolusername (talk) 14:54, 12 August 2019 (UTC)

I found a new programming language called "Kalkulon". It's an impure functional language, with mechanics similar to that of the Wolfram language. The only problem is, there doesn't seen to be any way to receive input, but I may be incorrect. You can check it out here. I'll give you a 99 bottles program example, from the 99 bottles of beer page.

bottles(n)=
(
    s1 = "bottle(s) of beer on the wall",
    s2 = "bottle(s) of beer",
    s3 = "Take one down, pass it around,",
    f1 = "%i %s,",
    f2 = "%i %s.",
    
    bottles = n,
    while ( bottles > 0; 
        PrintLn(Sprintf(f1, {bottles, s1})),
        PrintLn(Sprintf(f2, {bottles, s2})),
        PrintLn(s3),
        PrintLn(Sprintf(f2, {--bottles, s1}))
    )
);

Here is one made by me, that's shorter.

s = 99;while(s>0;PrintLn(Sprintf("%i bottle(s) of beer on the wall, %i bottles of beer.", {s,s})),s--,PrintLn(Sprintf("Take one down and pass it around %i bottle(s) of beer on the wall.",{s})));

I have created a compression algorithm. --àÂse ëË y± comme×s! (Please sign your comments!) A (taÑ) 02:16, 3 August 2019 (UTC) 03:51, 17 August 2019 (UTC)

There was a conversation here, but I removed it because it contained very large quotes that most likely infringe copyright. --ais523 20:33, 22 August 2019 (UTC)

Golfed "Are there any mods here"?

(% is the modulo operator.)

%s∃?

Explanation

%    (Mod)ulo standing for moderator
 s   Make the previous item plural
  ∃  The status of whether the previous item exists
   ? Indicator of undertainty

Is the top of the stack 0?

s   ㏎Push the value of the accumulator multiplied by 2 after converting to a number; if failed, double speak the value.
 ∃  ㏎Push whether the top-of-stack value exists onto the stack

The top of the stack is outputted.

Sandbox

1+ is a stack-based esoteric programming language invented by User:Parcly Taxel where 1 is the only literal. It only has 15 possible diverse syntactic items, however despite this restricted set of instructions, it is actually very easy and user-friendly to program in. For an easy language one would expect a full set of arithmetic instructions, but 1+ only has two of them: + (addition) and * (multiplication), and this concept has beed derived from the concept of integer complexity, and it is possible to produce any numeric constant using only these two arithmetic operations. 1+ is unique as well; it has special stack-manipulating instructions such as \ (rotate the stack downwards) and / (rotate the stack upwards), which is uncommon in more normal stack-based languages such as Forth. This allows programmers to manipulate the stack much more easily, thus ensuring the easiness of programming in this. Control flow is also relatively simple, and there are only two of them that exist in 1+: # (a goto instruction in 1+) and (|) (the way to define subprocedures). The goto instruction is capable of producing conditional statements because the * instruction can multiply a constant conditionally based on whether it is 0, and the subprocedure syntax is there for making programming even easier and higher-level.