« first day (1993 days earlier)      last day (2847 days later) » 

11:01 AM
@TùxCräftîñg, what do you mean by two memories? two registers? the stack and the map/address system
 
@DestructibleWatermelon the command `\` swap between the two memorys
 
?????
what are the two memories?
oh, for the addresses
 
the code ##!\#? will return undefined for example
because the address 0 was setted in the first memory but the memories are swapped
 
but
but why do you need two sets of extraneous memory
 
for example a main memory and a buffer
 
11:04 AM
but
but what is the stack for then???
 
operations can only operate on stack
the memories are to store variables for example
 
also, why do you call it a golfing lang
and then use unicode multibyte chars
that is the antithesis of golf
 
i am working on a codepage
 
alright then
why not
also, if you have two stacks, or a special command, it is possible for tc. I'm not entirely sure about regular stack though
but two stacks is cool
or rotating the stack
in my opinion, a second stack would be a better secondary memory
just my opinion though
Also beatnik is pretty cool. I should get an interpreter or make one myself
there is a link on wikipedia to an interpreter.
but it was lie!
 
link to the wikipedia plz because i cant find it
 
11:15 AM
Beatnik is a simple stack-based esoteric programming language, by Cliff L. Biffle. A beatnik program consists of any sequence of English words. Each word is assigned the score you would get for it in a Scrabble game. The value of the score determines what function is performed. Functions include pushing the score of the next word onto the stack, testing the stack and skipping forward or backward in the program and other stack operations. == Overview == === Markup === The interpreter reads the words in the poem, ignoring punctuation and whitespace and newlines. Some functions are one wor...
not sure if TC
I'm not sure if its possibly TC
with only one stack
 
Soars, larkspurs, rains.
Indistinctness.
Mario snarl (nurses, natures, rules...) sensuously retries goal.
Agribusinesses' costs par lain ropes (mopes) autos' cores.
Tuner ambitiousness.
Flit.
Dour entombment.
Legals' saner kinking lapse.
Nests glint.
Dread, tied futures, dourer usual tumor grunts alter atonal
  garb tries shouldered coins.
Taste a vast lustiness.
Stile stuns gad subgroup gram lanes.
Draftee insurer road: cuckold blunt, strut sunnier.
Rely enure pantheism: arty gain groups (genies, pan) titters, tattles, nears.
longer than INTERCALL ._.
 
It appears to be on Esolangs:
 
> Since there is only a single stack for data items, and since data items are finite (integers from 0 to 255), and since it is not possible to access values from arbitrarily deep in the stack, Beatnik is not Turing-complete,
so the memories of your-mom make it TC
and beatnik is not TC
Ho humbuzz, Dionysus. | orgasm if I feel altruistic & alone...

Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch?! Ha!

Monarchies spoil; language intermediates everyone!
 
well, at the very least, limit the amount of extra memory
 
11:23 AM
._.
@DestructibleWatermelon why? this will remove turing completeness
 
a turing machine should have infinite amount of memory
 
the stack is memory
 
here it's not infinite, but only limited by the ram of the host computer
 
is Cjam TC?
 
11:24 AM
> since it is not possible to access values from arbitrarily deep in the stack, Beatnik is not Turing-complete
@DestructibleWatermelon ^
 
@SuperJedi224 I was thinking: with the B45/S12 rule, nothing can live outside of the initial bounding box, as any external cells will have at most 3 live neighbors. This implies that there are also no spaceships.
 
how do i do the quotes?
like what you did?
> CJam is Turing-complete. To show this, writing a Brainfuck interpreter wouldn't be too hard. A lazier proof is to say that the Underload commands :()^ correspond to the CJam commands _{}~.
oh i did it
 
@Mego Should I answer twice if I have one dog that changed names?
 
26 variables in Cjam
 
@DestructibleWatermelon Yeah, just > message...
> message...
@DestructibleWatermelon Infinite type-width?
 
11:27 AM
also, tux, you can simulate array, and so access arbitrarily deep elements, with two stacks, or with stack rotation
 
your-mom is as turing complete as a x86
 
Damn you .!
 
because a x86 have a stack, registers and memory
while your-mom have a stack and two memories
one 'register-memory' and a memory
 
that is not necessarily true
 
@DestructibleWatermelon If you have even 2 unbounded registers, then it can simulate a counter machine and is therefore TC.
 
11:28 AM
See, legion mammal is backing me up here.
 
@TùxCräftîñg Could you post a link to the GH?
 
Github
So I can examine the interpreter
 
I win the race!
˚U˚
 
@DestructibleWatermelon Congrats, you're the FGITW!
 
fastest gun in the west
 
11:30 AM
;u;
hooray
 
@LegionMammal978 Technically, yes. Practically, no. I wish there was a generally-accepted phrase for a language that is usefully Turing-complete.
 
happies dai ov mai laife
 
Could anyone help me do the . thing?
I'm bleeding emotionally!
 
@El'endiaStarman if the language can interpret brainfuck, it's turing complete
 
@El'endiaStarman Actually, it is actually TC. It is the famous Minsky machine. Assuming you can manipulate it in the same ways.
 
11:32 AM
@TùxCräftîñg BF is more on the "useful" side of TC, to me. I'm talking about arcane stuff like two-counter machines.
 
@DestructibleWatermelon Yes, I know. Read my message again.
 
@El'endiaStarman With two registers, I guess, you need a crazy I/O format, making most people simulate 3-counter machines for TC proofs
 
I think what you mean is not a turing tarpit
what is the opposite of a tarpit, huh?
 
So you don't need two registers simulating 4 registers simulating two stacks simulating a tape
 
11:33 AM
^
 
Fun fact: Once, I tried explicitly converting a Turing machine to a two-counter Minsky machine! It did not end well.
 
I don't understand what you mean
 
@LegionMammal978 The "crazy I/O format" is the essence of my objection to the "Turing complete" moniker. "Turing complete" says that anything that can be computed can be computed with the specific machine/language under consideration. It's hard to tell, without having done the research, that Turing completeness is actually quite weak.
Rule 110 is Turing complete, and I don't know of a program that's been written in it.
 
if a language dont have I/O this dont mean that it's not TC
 
11:36 AM
@El'endiaStarman And, as I said, that's why most proofs go for 3-counter machines...
(and ^^)
 
Please.help(Person.getByStackExchangeName("Midnightas"));
 
everytime i see the ^^ signs i see a face
 
@El'endiaStarman usefully?
 
@TùxCräftîñg You still have to set up the tape/stack/whatever appropriately to run a program.
 
11:36 AM
^^
 
Usefully is a meaningless distinction
 
@El'endiaStarman yeah but this dont mean that it's not TC
 
ever heard of the heap problem?
 
@Midnightas Exception: with what exactly?
 
@TùxCräftîñg You're still missing my point.
 
11:37 AM
@El'endiaStarman What do you mean by usefully
 
@zʏᴀʙiɴ101 With a .
 
@zʏᴀʙiɴ101 throw new Exception("Implementing the . operator for an AST language");
 
@Midnightas Exception: What is a AST language?
 
Alright, lemme grab a concrete example.
 
@TùxCräftîñg "An Abstract Syntax Tree language."
 
11:38 AM
@TùxCräftîñg throw new Exception("You told me that.");
 
@Midnightas query("Like 'foo.bar' being 'access bar from foo'?")
 
@MᴀʀsUʟᴛᴏʀ return true;
 
@Midnightas AST Language dont mean anything. You mean a parser for a language
 
I'm so close to 10k rep, I need a challenge idea
 
@Midnightas reply("That's not an operator.")
 
11:39 AM
@MᴀʀsUʟᴛᴏʀ The . is a operator
 
@TùxCräftîñg I guess
 
@TùxCräftîñg An amount of stack based languages utilise a rotate command
 
@MᴀʀsUʟᴛᴏʀ Thread.join(); // to stop an argument
 
you just have to return a thing like new AttributeAST(lhs, expression(bp))
@DestructibleWatermelon to swap the two values on the TOS ?
 
no, to put the top at bottom, or bottom at top
 
11:40 AM
@Midnightas query("Any example code? What are you stuck on?")
 
The language Pancake Stack is ostensibly Turing complete. I'd like to see you try to rotate the top three pancakes. Or multiply two numbers.
 
@MᴀʀsUʟᴛᴏʀ https://github.com/lvivtotoro/aldranis/blob/master/Aldranis/src/org/midnightas/‌​aldranis/Aldranis.java#L115
codes messing up links
 
octocat say me this dont exist
 
Here's my objection with regards to the vaunted status of "Turing complete": Turing completeness doesn't mean you can actually do anything beyond the simplest of operations.
 
11:42 AM
@El'endiaStarman theorically any problem can be computed with a TM
 
@TùxCräftîñg Oh my gosh, how do you keep missing my point?!?
 
@Midnightas Don't you need a storage method/object class first? (I haven't looked through the rest of it yet)
 
"Theoretically" != "Practically".
 
> A programming language is said to be Turing-complete if it is in the same computational class as a Turing machine; that is to say, that it can perform any calculation that a universal Turing machine can.
@El'endiaStarman ^
 
@MᴀʀsUʟᴛᴏʀ Theres AldranisClass
 
11:44 AM
Alright, I'm done. You just keep on ignoring what I'm really saying.
 
so what are you really saying?
 
@El'endiaStarman Practically?
Practical means different things to different people
 
I would draw the line of practicality, if it took a really long time to write, as in the amount of code is artificially, and would actually take days to write assigning to a variable or something
 
I mean, Pancake Stack is impractical for most people, but where do you draw the line?
Do you count brainfuck as impractical?
 
11:51 AM
^
 
If you mean as all-rounded as possible, though, that's probably any language that can assign functions
 
Okay, writing a translator from a 3-counter Minsky machine to Your Mom...
 
@Midnightas on every link of shareyourlanguage, the : is missing in https?://
 
what the hell?
I need to fix that, then
fixed
 
Question: How would one rotate the stack in Your Mom?
 
11:56 AM
^
yeah it's fixed
brb
 
Trying to figure out how to jump to arbitrary functions on the stack
 
@MᴀʀsUʟᴛᴏʀ Did you find anything?
 
@Midnightas uh why does it have no properties
 
@MᴀʀsUʟᴛᴏʀ What doesn't have properties?
 
@Midnightas AldranisClass
 
12:01 PM
What do you mean by properties?
 
@Midnightas objects (not functions)
 
Oooh.
 
but basically
find object with name of token on left of dot, find property/function/static function with name of token on right of dot
if that's an AndranisClass as well, you may need to handle stuff like foo.bar.baz
 
How would I handle foo.bar.baz.boz?
 
$ node ./lib/yourmom.js
;_; u fergit file name ;_; y u do dis
$ node ./lib/yourmom.js -
y u do dis ;_; y u given me a unexistant file ಠ_ಠ
$ node ./lib/yourmom.js /dev/stdin
foo
bar
y u do dis ;_; y u do a syntax error ;_; 'f'
y u do dis ;_; y u do a syntax error ;_; 'o'
y u do dis ;_; y u do a syntax error ;_; 'o'
y u do dis ;_; y u do a syntax error ;_; 'b'
y u do dis ;_; y u do a syntax error ;_; 'a'
y u do dis ;_; y u do a syntax error ;_; 'r'
ಠ_ಠ
 
12:08 PM
probably keep the object in scope
 
while the next tokens are a dot and an identifier, access that property/method
otherwise, return the object
 
@El'endiaStarman The link has died! D:
 
oooh, alright
 
(Context: see the starboard)
 
12:09 PM
Can you give me some sort of reference code?
 
@LegionMammal978 ._.
 
@TùxCräftîñg _
 
@LegionMammal978 What is this emote?
 
@zʏᴀʙiɴ101 ಠ_ಠ → ._. → _ →
 
12:12 PM
:31027088
 
fixed the syntax error
 
@zʏᴀʙiɴ101 ​
 
Hey, I like the emote? :/
 
brb i restart my browser
i am back
 
12:13 PM
@TùxCräftîñg Why you restart your browser?
 
@zʏᴀʙiɴ101 ram overload
 
Ah, you use Chrome, then.
 
no i use firefox
 
Then why the RAM overloads?
 
12:15 PM
my browser was lagging but idk the cause
so i think this is a ram overload
 
I use FF, but would (and used to) use Chrome until it started making Windows BSoD and Ubuntu just freeze indefinitely
 
if (token === ".") {
    Integer pos = position;
    Object object = getObjectByName(tokens[pos--]);
    while (tokens[pos + 1] === "." && isIdentifier(tokens[pos + 2])) {
        String key = tokens[pos + 2];
        if (object.functions.javaHashmapHasKeyMethod(key) {
            object = object.functions.get(key);
        }
        //else if ()//etc for staticfuncs and properties
    }
}
@Midnightas something like this^
 
okay, thanks!
 
@LegionMammal978 now your-mom exit on syntax error
i have found a utility to AHK \o/
 
@TùxCräftîñg ???
 
12:24 PM
AutoHotKey
 
@TùxCräftîñg a utility to AHK?
help where should setup permissions go
 
bind a key to ಠ_ಠ
 
@TùxCräftîñg i have an ime that does that
i just type at least one letter of disapproval and then it appears
 
Can someone give me a simple 2-color TM?
:31027407 i.e., a binary tape
 
12:28 PM
@MᴀʀsUʟᴛᴏʀ thx
 
Or the six-state two-symbol busy beaver?
halp people should there be seperate permissions just for a startup script
or maybe for an install/repair/remove script (i.e. mostly one-time)
 
0
A: Sandbox for Proposed Challenges

insertusernamehereThis will be a code-golf challenge. How fast is your Stack Exchange community? tl;dr Your task is to find out how fast a Stack Exchange community reacts. "How fast" is here the average of the time elapsed until the first answer or the closing of the question. Input the Stack Exchange site...

 
what would have to happen for the masses to stop using google?
 
if google shut down
 
the world will be better
 
12:41 PM
@NathanMerrill if google created skynet maybe
apparently it's actually possible, so google are taking precautions
 
Google already created self-driving cars and people haven't stopped using Google yet
That's just the first step to Skynet
 
^ & ^^
 
1:09 PM
ಠ_ಠ
 
ಠ____________________ಠ
ಠ益ಠ
 
ಠ_____________________________________ಠ
I found that on the subreddit /r/yesyesyesno
It's very awesome
 
^ The spam duet
2
 
aww
 
1:20 PM
ಠ_ಠ
 
@MᴀʀsUʟᴛᴏʀ yes, it has 26 possible variables (uppercase letters)
 
@DestructibleWatermelon yes, brainfuck interpreters have already been written
@TùxCräftîñg CJam can also access values from arbitrarily deep in the stack
 
v
anyway your-mom have a stack and two memories so it's TC
 
@TùxCräftîñg proof?
 
1:32 PM
@LegionMammal978 depends what you mean by type-width and by infinite :p
 
@MᴀʀsUʟᴛᴏʀ i dont have any proof, but i think creating a BF interpreter is possible
 
rule 110 would be another way to prove TC
 
help should i not expose environment modules to stuff something runs?
 
Rule 110?
 
The Rule 110 cellular automaton (often simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it is similar to Conway's Game of Life. Also like Life, Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton. == Definition == In an elementary cellular automaton, a one-dimensional pattern of 0s and 1s evolves according to a simple set of rules. Whether a point in the pattern will be 0 or 1 in the new generation depends on its...
 
1:37 PM
is there usually any private information in env?
gh login credentials are sometimes in the env, right?
 
> Rule 110 is arguably the simplest known Turing complete system.
 
@MᴀʀsUʟᴛᴏʀ Not if you're doing things the right way
 
#include <stdlib.h>
#include <stdio.h>

char[3] buf = {0};

int main(int argc, char** argv) {
    fread(buf, 3, 1, stdin);
    return 0;
}
i get buf undeclared
 
@Doorknob the right way?
 
Cloning and push/pulling via SSH
 
1:41 PM
so it's save to say there's no private info in the env?
almost all the time?
 
Not unless you put it there
 
git stores credential info themselves
 
@TùxCräftîñg char buf[3]={0};?
 
@Poke thx ._.
 
:]
 
1:55 PM
@aditsu I would argue against that.
 
@Zgarb I might agree with you, depending on your argument :) I was just quoting wikipedia
 
My argument is that the encoding used in the Turing-completeness proof is so complex that it's actually very painful to simulate rule 110 to show that something else is TC.
 
I'd figure that a simple description of a Turing machine would be the simplest known Turing complete system.
 
It requires you to simulate a potentially unbounded run of the CA, starting from an initial configuration that's periodic to the left and right but with different periods, and check whether a local pattern occurs anywhere at any step.
 
Ooo, I'm closing in on my second Populist badge
 
2:08 PM
@LegionMammal978 If the "pattern" continues, the next larger run of digits in pi may be around the 600 millionth digit of pi, and would be 33333333.
 
@mbomb007 Pi is rational. QED.
 
@TimmyD Not it's not. Pi identifies as Trans... cendental. That makes it irrational.
 
Can I make an early nomination for Best Of PPCG 2016?
 
1
Q: Calculate A190810

TùxCräftîñgYour task is pretty simple, calculate the n-th element of A190810. Elements of A190810 are calculated in this way: a(1)=1, and if x is in a then 2x+1 and 3x-1 are in a. Test cases a(1) = 1 a(2) = 2 a(3) = 3 a(4) = 5 a(5) = 7 a(10) = 17 a(20) = 50 a(30) = 95 a(55) = 255 Since this is code-g...

 
2:25 PM
@TimmyD Unbelievable
 
@Downgoat No it's not. It's a second class defined in the scope of the first
So making it would be like new A.B()
And B can access all the static methods and fields and junk of A
Also do you have anonymous classes or automatic setters/getters?
 
2:39 PM
2
A: Calculate A190810

DennisJelly, 16 bytes ×3’;Ḥ‘$; 1Ç¡ṢQ³ị Very inefficient. Try it online!

the most inefficient answer EVER
crash when i>12 on TIO
 
Cloud9 was acquired by Amazon Web Services.....
 
@Quill !
 
2:56 PM
I got an email about it, so there should be one in your inbox as well, I guess. No mention of how payment plans are gonna work
Now that we have HyperDev for freeeee, hopefully we won't have to pull our teeth out with cloud9
 

« first day (1993 days earlier)      last day (2847 days later) »