User talk:Ais523/Archive1

Thanks a lot for providing a real example of a Fugue program! -- lament

Why don't you add Underload to the list in your user profile? :) --Keymaker 17:54, 15 Feb 2007 (UTC)

Thanks for creating the numerous Deadfish implementations. -- Jonskinner

Thanks for adding some info on Skull, though it would be great if you could add a CAT-example or anything like that :)

thanks, precisely after I send it I found your implementation :) which I'm happy for, thanks :D

Thanks (not to break the pattern) for clearing up the mess that I generally make all over the wiki, and for all the other help too -- Hiato 13:59, 30 January 2008 (UTC)

Namespace

Ehh I just put it there to see what would happen. You can delete it. This place is not really active. --(this comment by Melab at 21:08, 15 May 2008 UTC; please sign your comments with ~~~~)

Categories

Sorry I'm young but enthusiastic.Melab 19:32, 7 June 2008 (UTC)

Spam

Welll done and thank you for managing to get rid of the spam pages that have cropped up, and good luck keeping them at bay.

Do you reckon the spammer could have exploited a code injection hole in MediaWiki?

Who actually runs the wiki server/has access to the underlying database? This might help with diagnosing the problem.... -- Smjg 11:19, 9 July 2009 (UTC)

Feather

Based on our previous conversation about Feather, I thought up a language. It uses what you said about Feather, but also uses the exception-based flow-control you said Feather doesn't have.

Some features it has:

1. prototyping
2. assignment only to the original values of variables
3. print statements are not redone when the input to them has changed (The user is travelling in a TARDIS)

It's on my user page at Deschutroid Quasifeather. If you have the time, come and have a look. I'd be interested to hear what you think. Deschutron 07:52, 3 October 2009 (UTC)

Thanks

Thanks for letting me know about the user link problem. I simply signed it using three tildes, assuming that'd be okay. Afarnen 21:26, 22 January 2010 (UTC)

Thanks for the help! I am very new to the MediaWiki format :-) --Ajzaff 03:49, 2 May 2012 (UTC)

Serial vandal

Ejuzarih is wreaking utter havoc right now. -- Smjg 00:32, 24 November 2010 (UTC)

Userpage language list

You may want to include Reversible Brainfuck, Burn, and Suffolk in your list of languages. --Chris Pressey 19:59, 16 December 2010 (UTC)

Thanks for reminding me, I'll go and add them now. (I'll leave Feather out until it isn't vaporware.) --ais523 20:16, 16 December 2010 (UTC)

Mind if I contibute to Checkout?

I learned up on your language Checkout, and to facilitate easy leaning of how it works, I compiled a 'Checkout Quick Reference'. It is a table, with all the commands, their arguments, and a short description of what it does. Mind if I put it to the end of Checkout or put it in a subarticle? --Iconmaster 21:36, 22 February 2011 (UTC)

Delete spam pages

Hey, since you seem to have the ability to delete pages, I think you might like to delete Talk:Undefined behavior and Talk:PATH? — Timwi 01:14, 21 April 2011 (UTC)

I see you deleted more spam pages yesterday, but the block log contains nothing more recent than 22 Nov. Have you given up blocking spammers, or is this an oversight?

(I've asked Graue to get a proper captcha set up on this wiki - any clue when/if it'll happen?) Smjg 15:27, 4 December 2011 (UTC)

The spambots are creating new accounts and then only using them once, so a block would do nothing. I don't have enough permissions to block the IP address behind the account creation for more than 24 hours, and I think the spambots know that (and so won't try again from the same address for 24 hours). So blocking them would be pointless. --ais523 20:02, 4 December 2011 (UTC)

Do you mean that if you select "Prevent account creation" or "Automatically block the last IP address used by this user, and any subsequent IP addresses they try to edit from" when blocking, this block only lasts for 24 hours? This is another problem it's time Graue did something about.... — Smjg (talk) 12:00, 5 December 2011 (UTC)

Indeed, and (except in MediaWiki versions probably more recent than the one we have) the autoblock only triggers on the user's next edit. This is intentional, on the basis that we don't know whether it's a dynamic IP or not because we can't see the IP. --ais523 12:23, 5 December 2011 (UTC)

You mean MW is designed to avoid bloating the database by adding IP blocks before it is known that the IP will ever be used again - even though the spams already bloat the database far more? — Smjg (talk) 12:51, 5 December 2011 (UTC)

It's a privacy thing, so that people can edit without having to worry about their IP being tracked, apparently. (The sort of people who edit Wikipedia tend to be quite concerned about that.) --ais523 12:55, 5 December 2011 (UTC)

So why does it offer to block the last IP address the user used when it in fact has no record of said IP address in order to block it? — Smjg (talk) 22:03, 5 December 2011 (UTC)

It blocks the next IP address they use; and if they try to edit again in the future, blocks them again. --ais523 12:38, 6 December 2011 (UTC)

Anyway, is there any point in me replacing the content of spam pages with "Spam removed", or am I just wasting my time? (Does doing this make it any easier for you or other admins to find spam pages in order to delete them?) — Smjg (talk) 17:20, 9 December 2011 (UTC)

There's no point in doing that, because we can delete the page just as quickly whether you do or not. --ais523 20:31, 9 December 2011 (UTC)

I added something at the page of talking to PATH. --PrySigneToFry talk to PrySigneToFry 2024年7月5日，22:05 农历五月初三 (CHN)

Just wondering....

Is there a hidden pref to do that UTC thing, or do you paste it in manually each time? — Smjg (talk) 22:03, 5 December 2011 (UTC)

It's Preferences | Raw signature, combined with a bunch of complex wikicode in the Nickname field that uses a bunch of template substitutions to create the signature. --ais523 12:38, 6 December 2011 (UTC)

I guess you use ~~~ and include the timestamp generation in your signature, rather than ~~~~. Have I got that right? — Smjg (talk) 17:20, 9 December 2011 (UTC)

Indeed. --ais523 20:31, 9 December 2011 (UTC)

Missed spam

The following spam pages seem to have been missed: User:Epja70ts863a User:Ttma21ps476a User:Erda82wq091n --Ørjan 08:03, 18 January 2012 (UTC)

Protecting pages

Hi, do you have the power to protect pages on here? If so, and Keymaker or one of the others doesn't do it first, would you mind at least semi-protecting Main Page and Language list? These two pages are major targets of vandalism by spammers. And for this reason I think you'll find it's both unusual and inadvisable to have no protection at all on the main page of any wiki. — Smjg (talk) 01:36, 27 January 2012 (UTC)

Spam

You emailed Graue a while back about the spam; did anything come of that? He doesn't seem to have got around to doing anything yet since replying to my email, and currently the entire recent changes page is completely filled with spam, which is obscuring several legitimate edits made today. This is getting completely ridiculous, considering it could be fixed with server access in minutes... —ehird 22:21, 4 February 2012 (UTC)

Page removal request

I made the language 0L without realizing it was effectively a copy of Nil; would you please delete the 0L page? Not sure if this is where to say this, but you said to ask you.

Here will do. (Or the article's talk page.) I've deleted it. --ais523 21:20, 12 December 2012 (UTC)

Filter 3

Don't you mean length(added_links) > 0? ehird (talk) 13:44, 29 April 2013 (BST)

Your Message/Changes

Hey. Thanks for informing me about the formatting of usernames and such on pages, I must have forgotten. Thank you for fixing all of the things I did, I just stumbled accross them while browsing the wiki and thought I may as well "fix" them. I'll be sure to more rigidly adhere to conventional formatting in the future! Sorry about my inconveniences.

Vriskanon (talk) 08:37, 27 March 2015 (UTC)

Page removal request

Hi, I'm new to this wiki and wanted to know which is the right way to request the removal of a page. I created the User:-Dark-Phantom-/DStack, but I already moved the content to the page DStack and the former is no longer useful. < -Dark-Phantom- | Talk > 00:28, 7 November 2015 (UTC)

Well, for future reference, if you want to move a page, click the downwards-facing triangle near "view history" and select "move" if you want to move a page. Hppavilion1 (talk) 00:31, 7 November 2015 (UTC)

Thank you very much, I had not seen the button. < -Dark-Phantom- | Talk > 00:42, 7 November 2015 (UTC)

Done. I don't think we have a strict procedure, but a common way is to replace the whole page with something like "Please delete". Although "move" is better when appropriate (it preserves page history). --Ørjan (talk) 00:47, 7 November 2015 (UTC)

Ok, I'll remember that, thanks. < -Dark-Phantom- | Talk > 00:52, 7 November 2015 (UTC)

For the reference, asking me or Oerjan is a fine way to make requests like this (although as other users point out, in cases like this you can just move the page). I've been ill recently and hadn't been able to check the wiki, but asking in any reasonable way (talk page, user talk page, IRC) normally gets the admin action done soon enough. --ais523 03:37, 12 November 2015 (UTC)

Thanks for the info. I hope you feel better! < -Dark-Phantom- | Talk > 16:38, 12 November 2015 (UTC)

Copyright Violation

Esme contains a violation of copyright because the author thought they could copyright esolang programs that they post on the wiki. As it is copyrighted, it should be removed, if for no other reason than to make a point. Hppavilion1 (talk) 00:47, 20 January 2016 (UTC)

I don't think that the author can violate his own copyright. GermanyBoy (talk) 20:40, 20 January 2016 (UTC)

Anything on this wiki is uncopyrighted, but the author can't violate his own copyright. --None1 (talk) 10:38, 24 June 2024 (UTC)

MiniStringFuck

Hi! I made a new language, you can see it here!

why is this on this talk page? Yayimhere (talk) 12:03, 28 August 2024 (UTC)

Because someone posted it there. It's not really an ideal fit for the topic of the page (which is mostly about communicating things that need my attention), but it also isn't the sort of thing that needs deleting, so I just left it. --ais523 12:05, 28 August 2024 (UTC)

kk. Yayimhere (talk) 12:08, 28 August 2024 (UTC)

Removal of my compiler

I just had put a compiler on the BF site, and then you wanted to add it to the main list, but you deleted it. Please fix this issue. --(this comment by sesshomariu at 3 November 2016, 9:54 UTC; please sign your comments with ~~~~)

Replied on the user's talk page. --ais523 10:02, 3 November 2016 (UTC)

Picofuck

Thought you might be interested in the Picofuck project given your Reversible Brainfuck contributions. Let me know if you want to collab :) Orby (talk) 23:29, 28 March 2017 (UTC)

Burn

I've heard of the programming language you made, Burn. Sadly, you forgot about it. Did you write about the details? --(this comment by BradensEsolang at 23:11, 18 November 2017‎ UTC; please sign your comments with ~~~~)

I listed all the details I could remember on Talk:Burn. I haven't remembered anything else since. --ais523 23:13, 18 November 2017 (UTC)

Also is the rule 110 in ascii art? hey, Thats a good meme! (talk) 18:37, 9 January 2020 (UTC)

A rude behavior

Context: the below was posted on User talk:ZM and orginally transcluded here by Hq9++fan; a subst'ed version is shown below --ais523 14:22, 31 March 2018 (UTC)

Saying "that's not how <includeonly> works" is rude. Hq9++fan (talk) 19:03, 30 March 2018 (UTC)

So then why isn't ais523, who said basically the same thing, rude? ZM (talk) 19:10, 30 March 2018 (UTC)

... These two edits were not made by the same users? I didn't realize that, so I only wrote that on your talk page. And there's a huge difference between behaviors being rude and people itself being rude. Hq9++fan (talk) 11:14, 31 March 2018 (UTC)

For what it's worth, "you must be drunk" (said by Hq9++fan to Oerjan earlier) is ruder, so I don't think ZM is out of line here.

"ruder" is extremely subjective, and it's not even rude because Oerjan did something extremely strange. So it's appropriate. --(this comment by Hq9++fan at 14:18, 31 March 2018‎ UTC; please sign your comments with ~~~~)

I'd advise you to remove the <noinclude> on your talk page (or at least change to <onlyinclude>) because the "add topic" button will add a topic after the noinclude (it's automated and doesn't remove comments). There's not much purpose in protecting the page against transclusion because transcluding a user talk page isn't a meaningful operation anyway. (In fact, I just modified the site settings to disallow it.) --ais523 13:28, 31 March 2018 (UTC)

Alright, removed the tags. Thanks ^_zM (talk) 13:33, 31 March 2018 (UTC)

How can I paste my own code on this wiki? (I didn't violate others' copyright)

I put my own code on this wiki(Without violating with others' copyrights), but you blocked me. And, I really want to do that, but I can't, because that is genuinely my own code. There is no link linking to that code. How can I do that? ...oh, I found how to do that, but I'd like your advice. Also, is the pasteing on [1] with [2] okay?

I am sure that this is the case of "Copyright Violation".--User:Asdf

Links per se do not violate copyright; they do not incorporate the referenced work into the wiki. The legal problem is that all contents on this wiki are under CC0 license, which is essentially putting it into the public domain. This is much more permissive than common open source licenses. Basically to put contents here, it either has to be in the public domain or you have to have the right to relicense it; generally that means you have to be the sole author of the code (or have permission by all authors to relicense it).

As to the question how you can put your own code here, you definitely can, but are you really the sole author of everything you added? For example, your Brainfuck rot13 code is eerily similar to (though not literally the same as) https://github.com/bonomat/rot13-brainfuck/blob/master/rot13.bf so I'd have doubts. You added comments but that does not make you the sole author of the code. I didn't look at your other contributions. Int-e (talk) 09:59, 28 June 2018 (UTC)

The problem's not to do with you submitting your own code, but due to you submitting other people's code. Quite a bit of what you submitted was written by other people, and thus violates their copyright. --ais523 23:50, 28 June 2018 (UTC)

I only referred to the recent edit(the Brainfuck Interpreter). I am indeed the sole author for that. (And, that ROT13 code is indeed copied. I am really sorry for all the code that I copied(except for the Truth-Machine).) Is being the sole author of that interpreter make me able to put my code on this wiki? (I promise that I will never violate others' copyright anymore.)--User:Asdf

Yes, if you're the only author you can put your code here. However, lengthy blocks of code are normally best saved for articles where they don't really break up the flow. You could perhaps try putting the code on a page in your userspace (e.g. User:asdf/brainfuck interpreter) and linking to that, if the page is one which normally uses links rather than inline interpreters. There's also the The Esoteric File Archive which would be a more appropriate place, but I'm not sure how easy it is to submit there these days. --ais523 18:40, 29 June 2018 (UTC)

Game of Life theorem subtleties

Re your edit https://esolangs.org/w/index.php?title=Game_of_Life&diff=57564&oldid=57555 about Game of Life with bounded population, I think you're accidentally losing some strength here. I meant to claim that Life is Turing Complete even if there's some large finite bound that the population count can never exceed during the evolution, by simulating some sort of counter machine with the counts encoded in positions of certain objects and an empty background. After your edit, you seem to only claim that Life is Turing complete even if you bound the population count of the initial state. I could be wrong, but I think the stronger state is still true, and would like the text to imply that. Admittedly, that sentence starts by talking about the initial state, but still, the stronger claim is useful to know. – b_jonas 10:45, 12 September 2018 (UTC)

Oh, I see. I think "it's TC with a permanently bounded population count" is probably less interesting than "it can construct anything starting from a fixed population count", but there's no reason you can't list both in the article. Your statement should probably be a separate sentence, though (perhaps linking to an article about "sliding block memory"), because it's not really a statement about the complexity of a state at all.

I need to write an article about universal constructions in esolangs sometime. There's a conceptual difference between, say, the :*()^a! subset of Underload and the :()^ subset of Underload; the former lets you build "arbitrary Underload circuits", the latter doesn't and yet it's still TC. The "fixed maximum population count" version of Life is an example of the latter, whereas most actual effort in Life programming has concentrated on the former. --ais523 17:45, 12 September 2018 (UTC)

Featured articles

This has not been going circa 2013. If you are an admin, can you restart it? BradensEsolangs (talk) 14:38, 12 December 2018 (UTC)

It was a surprising amount of work for the admins to deal with, so we eventually just parked it on brainfuck. It'd be interesting to resurrect it, but someone would need to put in the work evaluating articles for completeness, writing blurbs about them, and updating the records; and even at the time, I'm not sure any of us could remember all the steps involved in that. --ais523 01:33, 13 December 2018 (UTC)

Let's just find the one that is most complete. BradensEsolangs (talk) 01:42, 14 December 2018 (UTC)

Redistributing work under CC BY-NC-SA 3.0 CZ licence with permission from original author

Hello! As you probably know, you've deleted my page that was redistribution of work under licence mentioned above. This was rather radical move as it was with permission of original author (Charles University). Please contact me so we can solve this misunderstandment. Groowy (talk) 09:49, 30 May 2019 (CET)

So if I get the situation correctly, if I would create my own source that has no copyright on it (as original author allowed me to do) from original source and then I would use it as source for esolang article here than it would be ok?
Here is short diagram for simplification of previous sentence:
Source copyrighted under CC BY-NC-SA 3.0 CZ licence → My translated source with no copyright published with permission of original author → Article on esolangs.org with no copyright from my translated source

OK, maybe now I finally know what was your issue in first place. I will modify the resource to that article if needed (if so it would be really helpful if you could give me the some form of the original page you've deleted because it would take me a significant amount of time to translate it once again) but I want to give my last try to find out if its really needed. I'm not really a person that understands how does this form of copyright works but from what does the summary on https://creativecommons.org/licenses/by-nc-sa/3.0/cz/deed.en says I've understood that I'm eligible to share given work in non-commercial use if I'll credit the author. But I'll be more than happy if you could more in-depth describe your thoughts about it

Thank you for giving me a chance to redo that article so it won't be direct translation of resource with copyright licence mentioned above. I'll contact you soon so you could decide whether it's not a direct translation or it still need some more work. Groowy (talk) 05:14, 31 May 2019 (UTC)

Didn't you just block User: A a while ago? How come he was able to edit his talk page just now? Areallycoolusername (talk) 12:21, 16 July 2019 (UTC)

Could I be a new admin of this wiki?

If I were to be, I'd like to do these things:

1. Promote to categorize every article on at least one category.
2. Organize/Categorize templates.
3. Promote to use <pre class="rectwrap">...your code goes here...</pre> instead of putting a space in the beginning of lines.
4. Encourage people who are inactive with designing their languages.
5. Make a policy of deletion.
6. Organize policy of editing.

But first of all, do you have any policies about what they must do? Also are there anything above that I could do if I were not an admin?--YamTokTpaFa (talk) 04:22, 3 August 2019 (UTC)

You can do almost all that without being an admin (the only thing that requires admin help is deletions, and those are best discussed first, on wiki talk pages or maybe the IRC channel; if there is consensus, an admin will likely delete the page upon seeing it, and you don't need to be an admin to start a discussion). So a promotion to admin is likely unnecessary. (It's a good idea to get consensus before categorising templates, incidentally, but you'd have to do that whether you were an admin or not).

Jobs that require an admin are normally fairly technical (sometimes requiring deep knowledge of MediaWiki), and also happen quite rarely here; we have enough admins to do them already. Wikis are set up so that only potentially abusable things (e.g. things that aren't easily reversible) need admin powers; almost everything can be done by regular users.

By the way, contacting users about their articles might not be as helpful as you think; it's quite possible that many of them are no longer active on the wiki. (That doesn't necessarily mean it will hurt to try, of course.) --ais523 04:29, 3 August 2019 (UTC)

Bug: Why is HQ9F+ shown on no category pages?

--YamTokTpaFa (talk) 09:42, 14 September 2019 (UTC)

PS. I tried adding sortkey, which is represented with what is called DEFAULTSORT, and worked. Why? Because title has a plus sign so recognized as a special symbol in php?--YamTokTpaFa (talk) 09:45, 14 September 2019 (UTC)

It's likely due to the (arguably) buggy page cache of MediaWiki. For non-logged-in users, rendered pages (including category pages) are cached, and the invalidation mechanism does not understand categories. HQ9F+ appeared for me as soon as I logged in, I think before you added the sort key. It still doesn't show up if I browse anonymously. It will appear for non-logged-in users the next time all cached pages are regenerated, which is typically when I update the MediaWiki version. Or if task T26575 is ever solved. --fizzie (talk) 09:50, 14 September 2019 (UTC)

Any features to insert mathematical formulas like TeX style?

I noticed that this wiki doesn't have what wikipedia has a tag math. Anything similar?--YamTokTpaFa (talk) 08:10, 15 September 2019 (UTC)

It doesn't have any extensions for formatting math installed, so the closest you can get is writing HTML that looks similar (x² and friends). If there's demand for such an extension, you might be able to persuade User:fizzie to install it. Ais523 non-admin (talk) 10:05, 16 September 2019 (UTC)

I did, in fact, install Extension:Math. So feel free to $i\hbar {\frac {d}{dt}}\vert \Psi (t)\rangle ={\hat {H}}\vert \Psi (t)\rangle$ it up. As long as it doesn't cause any problems (math support in MediaWiki is quite messy), we'll keep it around. --fizzie (talk) 18:46, 9 January 2020 (UTC)

And in my times that hadn’t been here, eh. Now I need to reformat all my pages! :P (Hm or not all of them. Thank you anyway!) arseniiv (talk) 23:37, 9 January 2020 (UTC)

Why so much?

Why you maked so much esolangs? -- OsmineYT 14:57, 25 September 2019 (WEST) Why not - not ais.

The Waterfall Model UTM

Recently we have discovered a way to implement The Waterfall Model into Magic: the Gathering without allowing for nondeterministic behavior. See https://www.mtgsalvation.com/forums/magic-fundamentals/magic-general/615089-most-turn-1-damage-in-a-deck-with-no-infinite?page=97. This means that we can set it up for a Busy Beaver machine or to iteratively look for an odd perfect number, and then step away to simultaneously make and ruin a judge's day.

The issue is that we may run out of creature type namespace, My implementation uses up 2 creature types per waterclock, so with there only being 249 creature types currently, we are limited to size 124 machines. (124 waterclocks)

Is there a limit on the computation that can be done on a waterfall machine of that size? FortyTwo (talk) 19:53, 3 March 2020 (UTC)

I don't know the smallest possible number of waterclocks for a Turing-complete construction, but it's much smaller than 124. (My current guess is 7, but it is only a guess, and I don't have a construction.) With as many as 124, there'd be space for a pretty powerful construction; you could likely even implement a Turing machine in a more or less direct way (by using two of the waterclocks to encode the left and right halves of the tape via their digits in binary). --ais523 02:01, 4 March 2020 (UTC)

Thanks for your help! In trying to infinite proof the deck, it would be easier if an alternate version of the waterfall model was proved Turing complete, in this version, when a waterclock triggers, it triggers its rule X times, where X is the number of times that waterclock was incremented since it last hit zero. Playing around with it a little shows it is really easy for stuff to blow up, and I suspect it might be too volatile to be Turing complete. FortyTwo (talk) 03:17, 7 March 2020 (UTC)

It isn't obviously Turing-incomplete, but you aren't going to be easily able to modify any of the existing proofs to prove it Turing-complete. The basic issue is that one of the things that makes The Waterfall Model easy to reason about is that waterclocks can be held in "suspended animation" by increasing them and decreasing them at same rate, and when they're eventually used, they'll do the same thing every time regardless of what has happened so far in the program. The alternate version doesn't have any nice properties like that, and in particular trying to implement anything in it directly seems like a nightmare. It might still be Turing-complete, but I'm not currently sure how you'd go about proving it. (I may continue thinking about this, but don't expect to come up with results any time soon.) --ais523 15:30, 7 March 2020 (UTC)

OK, I have a construction now; see Spiral Rise for details. It looks like I guessed high, with the construction there requiring only 6 waterclocks + 1 halting waterclock (the halting waterclock can flood, the others can't). It also probably works with slightly smaller numbers than the 10-waterclock construction that was discussed on IRC. It hasn't quite been proven TC, but I would be astonished if it wasn't. --ais523 11:14, 16 March 2020 (UTC)

Where can I find a compiler/interpreter of ABCDXYZ?

Since the article was categorized to Category:Implemented, should the link to the implementation be put there. --YamTokTpaFa (talk) 03:39, 10 April 2020 (UTC)

I found the implementation on my hard drive and copied it to the talk page. --ais523 21:27, 10 April 2020 (UTC)

Should Nuts be deleted?

I have another topic. The original designer deleted his or her accounts, and the repository for reference implementation is also gone. I have seen if it were archived on wayback machine, but it was not at all. If we keep the contents here, would we violate to his/her willing? Should we try to contact them first and ask them if we have to delete the article?--YamTokTpaFa (talk) 03:45, 10 April 2020 (UTC)

All the revisions on esolangs.org appear to have been written by you. Are they your own work? If so, it's up to you, not the original author, whether to keep the content around; it's quite common for people to document other people's esolangs, after all. If they're copied from a non-public-domain source elsewhere then the page would need to be deleted, but for copyright reasons, not authorship reasons.

Incidentally, if all other content about an esolang has gone offline, that can make it more important to preserve it here, rather than less important, as people looking for information about the language would have nowhere else to go. --ais523 21:29, 10 April 2020 (UTC)

Adding Underload numbers

I have a list of Underload number representations at https://pastebin.com/iDtQp8ve but when I tried to add them to the page I learned that the wiki blocks non-admins from making very large additions to pages. I was told to inform an admin of my attempted action and am doing so now. --(this comment by CatIsFluffy at 02:34, 17 April 2020‎ UTC; please sign your comments with ~~~~)

I'm not convinced the wiki could handle a page quite that large! 124 kilobytes is well over the normal limit for the size of a page. At some point, it's best to host the information elsewhere and link to it. (Also, the higher the numbers get, the less likely that an automatically generated representation will be optimal.) You can expand the page if you like, but I'd recommend keeping it below 30 kilobytes or so; if you do that you're unlikely to have trouble with the edit filter. --ais523 10:39, 17 April 2020 (UTC)

Okay CatIsFluffy (talk) 18:34, 17 April 2020 (UTC)

Thoughts on generalized simple translations

Couldn't you roll the command string that would prefix the simple translation or suffix the simple translation into the isomorphism between machines? Orby (talk) 14:15, 6 May 2020 (UTC)

Your view of command strings is perhaps too specific to BF-like languages. I'm thinking of cases where it may affect parsing; e.g. the prefix ends with an unmatched quote, the suffix starts with one, and all the translations of the commands therefore end up in a string literal. (The suffix then contains an interpreter that takes the program to run from the string literal.) As far as I can tell, this means that any Turing-complete language which has string literals can be simply-translated into from any computable language. (The interest, of course, is that this can then be used to prove that there are Turing-complete languages that don't have string literals. An obvious example is Incident.) --ais523 04:13, 8 May 2020 (UTC)

Please delete an image.

I’ve posted an image with someone’s personal info that I got from email. May you delete it? --Emerald (talk) 01:04, 2 March 2021 (UTC)

I've taken care of it. --ais523 14:44, 2 March 2021 (UTC)

Page deletion

Euler's birthday is coming^{[citation needed]}. Should we make an article about Project Euler? ColorfulGalaxy (disambiguation) (talk) 02:03, 14 April 2021 (UTC)

What kinds of Project Euler source codes can I submit? ColorfulGalaxy (disambiguation) (talk) 08:15, 30 April 2021 (UTC)

What happened to Trump? Why did you think that he "harrassed" my user talk page? Did he post any codes? How should I upload files like the Befunk truth machine? ColorfulGalaxy (disambiguation) (talk) 02:05, 6 May 2021 (UTC)

This page was also deleted. And you said: "userspace page not created by the owner of the userspace / without the permission of the owner of the userspace" Also I found a bug, you can put emoticons outside the edit summary like this . Wait, what happened to the Sandbox talk page? ColorfulGalaxy (talk) 02:17, 6 May 2021 (UTC)

Recently, Trump's behavior puzzled me a lot. For example, he created a lot of esolang-related titles, such as "Aheui Alphabet". Wait, you removed his introduction???? ColorfulGalaxy (talk) 08:10, 11 May 2021 (UTC)

Is my "Google simulator" off topic? I put some links in it. Also, is "QR code" an esolang? ColorfulGalaxy (talk) 08:10, 11 May 2021 (UTC)

Program too long to add into page

I was attempting to add my Godencode "Hello, World!" program into the Hello world program in esoteric languages page, but it was too long for me to add it in (which makes sense, it's 17,000 bytes long and pretty repetitive). Could you put the program in for me? Thanks! -Plasmath (talk) 01:33, 13 June 2021 (UTC)

Problem creating account

A friend of mine is unable to create a new account. The registration claims that the CAPTCHA is missing or incorrect even though we have supplied the correct answer. Could you look into this and come back to me? Thank you in advance. Timwi (talk)

Issue resolved. The problem was that copying the Befunge program in Discord removes the backslashes. Sorry to bother you, though this might be a possible impetus to use a program that doesn’t use backslahes? Timwi (talk)

regarding implementation of Capuirequiem

I found that the php interpreter for capuirequiem could be found here:
http://web.archive.org/web/20070825122842/http://zzo38computer.cjb.net/esoteric/capuireq/source.php
but I am unsure if it really is the original interpreter (whose link is dead). could you look into it, and add it if it is? --Pro465 (talk) 11:06, 11 June 2023 (UTC)

non-plushie-complete

is it ok if i add a category for non-plushie-complete languages? like input-only ones or ones that cant print numbers? just asking ;) Cinnamony (talk) 13:38, 20 June 2023 (UTC)

Probably not – it's unlikely that such a category would be maintained, and it would mostly be redundant to Category:Unusable for programming. Although you could ask on Esolang talk: Categorization, I doubt you'd get sufficient support. --ais523 13:41, 20 June 2023 (UTC)

oh ok, i wont bother then :( Cinnamony (talk) 13:46, 20 June 2023 (UTC)

your bfjoust didnt work in my javascript interpreter

i was going to cheat against somebody with ([+])*9 but your bfjoust didnt work in my javascript interpreter :( cinnamonytalk Time: 13:45, 22 June 2023 (UTC)

C-INTERCAL compiler issues

Hello, I've tried to compile C-INTERCAL a few times on my Windows 10 PC. Compiling on both Cygwin and WSL didn't work because I can't run the Makefile without getting errors. I also tried compiling manually with gcc, but also got errors. Debian package manager on WSL also didn't work, although I can't remember why. Is there any way I could obtain a pre-compiled binary that would work either on Windows 10 or Linux in WSL? (I currently have Ubuntu on WSL but could install more if needed.) BoundedBeans (talk) 05:00, 26 June 2023 (UTC)

It looks like some aspects of the code had broken with modern compilers. I've pushed a new version to the repository which should work better on modern machines. On Ubuntu (or WSL pretending to be Ubuntu), install the packages build-essential, flex, and bison, and get the latest version of the code by cloning or pulling from the git repository at http://nethack4.org/media/intercal.git. From there, the normal configure --prefix=directory, make, make install should work (you can choose the directory that you want to install C-INTERCAL to by giving it as the --prefix argument to configure). --ais523 03:17, 27 June 2023 (UTC)

Running configure required me to mess around with autoconf a bit, and I eventually managed to get that working, but running make gives error 127 on line 828 and error 2 on line 556 (both lines come from the file Makefile). I actually was able to install it through apt and it works fine. Either I must not have tried installing it through apt and thought I did, or you fixed it (I'm not sure if you posted the update to apt or not). Thanks for the reply and the help! BoundedBeans (talk) 18:25, 29 June 2023 (UTC)

I actually got it to compile! The git file you linked doesn't include a configure script, only configure.ac, but after downloading the tarball from catb.org, copying the git contents into it, and choosing to overwrite the files, I now had a configure script which worked correctly. This was on a real Linux machine I received as a gift; I will try it on WSL soon. BoundedBeans (talk) 22:39, 7 February 2024 (UTC)

Confirmed working on WSL, though you have to use Linux tools to extract the tar and copy the files. Using Windows File Explorer to do that results in errors (I think it messes up file permissions, maybe). Also, intercal-0.30.tar.gz is not actually GZipped, so use tar -xvf rather than tar -xzvf. BoundedBeans (talk) 23:14, 7 February 2024 (UTC)

Delete image containing private information

File:Cinnamony.jpg contains the picture of User:Cinnamony and his exact position, I think it is inappropriate to leave it in this wiki. Please delete it. --None1 (talk) 10:32, 14 September 2023 (UTC)

Many other images uploaded by User:Cinnamony also contain private information (one of them is File:Nuigurumiato logo.jpg), please delete them, too. --None1 (talk) 09:33, 15 September 2023 (UTC)

I've deleted the first image and removed all metadata from the others. --ais523 10:00, 15 September 2023 (UTC)

mind verifying my proof?

Hello, I heard you were a mathematician, and designed Echo Tag, so I feel like you are in the perfect position for commenting about this proof:

Xeroxer/translate.rs

Thanks in advance! --Pro465 (talk) 06:24, 18 September 2023 (UTC)

Proofs that just consist of a single uncommented compiler can be valid, but are hard for other people to read – it would be much easier to check whether the proof is valid or not if there were some notes on how it works. As such, I haven't been able to tell whether it's correct or not (although one big advantage of an explicit construction is that you can typically just run it to see whether it works – if you want more confidence about whether it's correct or not, you can do things like working out the relationship between the number of cycles the original program and compiled program take to run, and see whether the compiled programs run in the correct time). However, I do think that using a tag system variant is probably the best way to prove Xeroxer Turing-complete.

I decided to think about how I'd go about writing a TCness proof for Xeroxer. My approach would be to show that it is possible to construct a substring of Xeroxer code that has multiple entry points, each of which copies the entire substring to the end of the program, then jumps to a specified offset – and that such a substring can be made to contain an arbitrary sub-substring. (You can do that by putting each of the entry points near the end of the substring, having it copy everything before it, then having it jump into the substring to copy the rest – you can hardcode all the possible "rest of the substrings" because they're short compared to the substring as a whole. This leaves the first part of the substring untouched, so you can put arbitrary data there.) Once you can do that, it's easy to construct a "dictionary" which has multiple entry points, each of which will copy a specified sequence of hardcoded code, and copies of the dictionary itself, to the end of the program, and then jump to a specified offset. And that gives you enough power to implement a traditional tag system by making the program alternating between dictionaries (which are all the same) and data (which store the tag elements, and work by jumping to one of the entry points of an adjacent dictionary, which then appends the production and dictionaries to the end of the program and jumps to the data of the mth-next word. I'm not sure whether your proof is doing something like this, or whether it works on a different principle. However, I think the argument here is sufficient to convince me that Xeroxer is Turing-complete, even if your proof is too hard to read and mine is too informal. --ais523 09:01, 19 September 2023 (UTC)

Thanks for taking a look at it, I am surprised to say that (if I understand your mechanism) my program does work like what you said. However, it only has one copy of the data (which also works like an instruction pointer), instead of alternating between program and data.

Btw, I created a direct tag system to xeroxer translator here: Xeroxer/tag2xeroxer.rs.

It also has comments and an overview. Hopefully you could understand it better than the previous one! --Pro465 (talk) 17:52, 19 September 2023 (UTC)

Delete duplicate category

Category:Tape-based is the same as Category:Cell-based and I've changed the only page in Category:Tape-based to Category:Cell-based, could you please delete Category:Tape-based? --None1 (talk) 10:06, 24 September 2023 (UTC)

Deleted. --ais523 12:23, 24 September 2023 (UTC)