« first day (2064 days earlier)      last day (2780 days later) » 

Anonymous
7:00 AM
@AlexA. I hope I did not unintentionally convey any dissatisfaction with your absence. You have real-life concerns due to being a graduate student, and those should absolutely take priority over PPCG. Our mod team is excellent, and more than capable of stepping up and keeping things running smoothly, even if one of them isn't able to be active all the time. You're a great mod, and a great guy, and I look forward to you being able to spend more time on PPCG in the future. :)
 
shortened a bit, probably could be shortened more though:
!urr-[*+.r_]' l[#[ (0'9l)( r[ '#r]u)(1'0u)(2'1u)(3'2u)(4'3u)(5'4u)(6'5u)(7'6u)(8'7u)(9'8u)]dd[*l]{*r},urr{ l}[ r]l]{#' l}dl"
 
I wish more people could use Logicode...
 
well, there is probably a GRE or something
 
GRE?
 
golden rule of esoalngs
didn't you say that one first?
 
7:06 AM
Oh yeah
The first rule was the BF one right?
OK, fourth rule.
Golden Rule of Esolangs #4: Thou shalt use Logicode in programming challenges (</selfpromotion>).
 
GRE- your language will usually only be used if it is a copy of something else, or really golfy
example: Brainfuck, a trivial adaption of p prime prime
 
@DestructibleWatermelon Wot
 
Example, befunge, comes after biota, and who knows what biota is? (its a 2d lang, but you probs didn't know that, which maybe proves point)
 
Yup
So no one will code in Logicode...
:( :( :(
 
what happened to pyramid?
 
7:11 AM
It died
Cause it was too hard to program in
 
no esolang should ever have that happen to it
;_;
gimme pyramid
nao
 
Uhh sure
Hang on
Crap
I deleted everything
 
D: you could try using testdisk to recover it
 
but i wiped it over
with the logicode code
 
7:14 AM
I would make eseljik thing but ehhh
 
Cause I didn't think anyone wanted to use it
 
@Qwerp-Derp not necessarily
 
Wot u mean?
 
A lot of the time disk reads/writes aren't in the same location
 
???
 
7:16 AM
lojban wikipedia is kind of pathetic
 
Lojban?
 
means logical language in lojban
is language
lojban. xamgu
ni'o la .tokios. goi ko'a zi'e no'u la'o py 東京 py cu trutca la pongu'e .i ko'a du pa lo 47 gugypau pe la pongu'e gi'e se xabju 12ki'oki'o prenu .i ko'a se zvati le ponjo truci'e .e le ponjo sorgugje'a balzda .e le ponjo sorgugje'a lanzu...
example of how pathetic it is
the wikipedia onebox has all the page's info but the image caption
 
Oh my
There's a Hakka page for Tokyo
 
halp, anyone use gmp often?
 
(Hakka is a dialect of Mandarin)
And it's better than the Lojban page
 
Anonymous
7:20 AM
Only when I need to install it for some other software
 
1
Q: The Base in the mix

Kevin CruijssenInput: A list/array of integers for which each item is in the range of 1-36. Output: The sum of the integers (as base 10), where each next integer is in the base of the previous value (starting with a regular base 10). Example: Let's say we have an input like this: [4, 12, 34, 20, 14, 6, 25, 13...

 
Halp
 
@Qwerp-Derp ?
 
now to implement division or something ¯\_(o.o)_/¯
 
Ummm
Hang on
circ v(a)->[
var k=p(j)
k
]
var j=1
This doesn't work
If I call v(whatever)
It returns a KeyError
 
7:35 AM
uh what happened
@Qwerp-Derp KeyError for what
 
KeyError: circ
@ASCII-only Halp?
 
@Qwerp-Derp Can you give more of the code?
 
7:52 AM
Umm sure
Hang on I changed it around a bit
circ v(a,b,c)->[
var j=p(b)
j
]
out v(1000,1,0)
circ m(n)->cond n->1/0
circ o(n)->cond n<->0+n/o(n>)
circ p(n)->[
cond n->var c=~((~(o(n)))>)/var c=0
cond (~n)<->var d=p(c)+0/var d=c+1
d
]
circ q(n)->[
cond n->var e=~((~(o(n)))>)/var e=0
cond (~n)<->var f=e+0/var f=q(e)+1
f
]
circ r(a,b)->cond m(a)&m(b)->r(q(a),q(b))/a
circ s(a,b)->!(m(r(b,a)))
circ t(a,b)->cond b->t(q(a),q(b))/a
circ u(a,b)->cond s(a,b)->u(t(a,b),b)/!(m(a))
circ v(a,b)->[
var j=p(j)
cond s(a,p(j))->var k=k+u(a,p(j))/var k=k
cond s(a,p(j))->var l=v(a)/var k=k
m((~k)>)
]
var j=1
The bottom one is the full code, the top one is just me playing around a bit (still doesn't work, though)
@ASCII-only Are you there?
 
@Qwerp-Derp Yeah, brb debugging
 
Is there a consensus that allows me to take a reversed input for dc? I ask because dc stores the input on a LIFO stack, so when printing the input numbers is starts with the last one.
 
example of what you mean pls
 
Anonymous
@seshoumara Unless the challenge states a strict order for the input, it's usually assumed that the input can be taken in any order. Reversed order of input(s) is usually fine.
 
8:01 AM
@DestructibleWatermelon dc -e "?f" <<< "1 2 3" will print 3 2 1, so I need to reverse the input to have it print 1 2 3
it's just how a stack works
I could make it work with a normal input, but that would require at least 30 bytes of flipping the stack and in my opinion it adds nothing to the solution I'm trying to give.
 
Hey guys
I've got a community project
PPCG: The Idle Game
Is anyone on?
 
8:22 AM
We all idling
 
So
Is it a good idea or not?
Wot
 
What is this project explain plz
 
Ummm
So I was thinking of making an idle game based on PPCG
Where you earn rep by posting answers
Rep is basically currency, which you can buy bots and stuff
To post more answers
And get more rep
 
KotH?
 
No, just a game
Just programming in general
 
8:29 AM
Hmmm
Seems interesting
 
Sounds good?
Ah
 
9:26 AM
 
9:43 AM
Harro
 
on The base in the mix challenge, I'm surprised by how many languages can take input in base up to 36. Some of the languages I use accept only til 16.
 
Anonymous
@seshoumara Python is magical :)
 
@MartinEnder ^(.+)\1*\n(\1+\n)*$/ is a regex for GCD on unary separated by \n
 
@Mego compared to those, my solution that manually converts using the coefficients of the polynomial, would look extremely long
 
hhehey
 
9:52 AM
@TonHospel did you see the link in my message? it's pretty much what I'm using, although you can shorten it with (\n?\1)*.
 
91/100 for fanatic :D
 
in ideone compiler l'output of above c program [coping the first function the more hight in the screen] is "Hello, WabcdefCode Ayylexicographically" without "\n"... — RosLuP 43 mins ago
> l'output
 
10:05 AM
Starting to make the game...
 
the h1 take half of the box o_O
 
Yay, I'm using pygame!
 
I need to make a less obnoxiously difficult esolang
 
@DestructibleWatermelon either that or use an existing one?
 
its not the same
 
10:19 AM
i have a esolang idea
 
a program is a number, instructions are determined by the divisors of the number
 
problem : that would be very limited , and looping will be impossible unless it is self-modifying
 
prime numbers are instructions, composite are blocks (the divisors of the composite numbers are the nested instructions)
 
10:23 AM
and esolang dont mean easy to program in ¯\_(ツ)_/¯
 
you realise, that the primes could be organised into any number of composite blocks?
as in you can't say from a number that they are nested in one composite factor...
 
aka order of instructions problem
 
also halp this game has a puzzle and it's unpossible
 
ast of 12:
[2, 3, [4, [2]], [6, [2, 3]]]
([number, list] constructs are blocks)
 
so how would you do a loop? Without that it won't be possible to do much in it.
 
10:26 AM
composite numbers
 
care to detail it a bit?
 
when numbers are composite, the divisors of the number are taken to form a nested block
 
literally any number that isn't prime or co prime has a nested block
 
not really
 
@DLosc if you provide me with a n interpreter I can create the jar
 
10:28 AM
6: [2, 3]
ah yes i misunderstood
sry
 
QUESTION: how to use vga text mode on a reasonable pc ? for example :where are the bytes related to control to topmost-leftmost character ? where i can find precise information on vga & graphics ?
 
Look at my code
 
i have no idea how to program in this language without bruteforcing :/
 
import pygame
import time

class PPCGGame_Main:
    def __init__(self):
        pygame.init()
        pygame.font.init()
        self.dimensions = (720, 480)
        self.screen = pygame.display.set_mode(self.dimensions)
        self.bg_colour = (0, 0, 0)
        self.font = pygame.font.SysFont("Monospace", 15)
        self.font_colour = (255, 255, 255)
        self.clock = pygame.time.Clock()
        self.init_check = 0
        self.init_list = []

    def mainloop(self):
        while True:
            self.clock.tick(20)
 
i can easily create a block of 2 prime numbers (p*q), but idk for other programs
 
10:32 AM
@TùxCräftîñg Which language?
 
11 mins ago, by TùxCräftîñg
a program is a number, instructions are determined by the divisors of the number
10 mins ago, by TùxCräftîñg
prime numbers are instructions, composite are blocks (the divisors of the composite numbers are the nested instructions)
@Qwerp-Derp
 
Ah
So something like 24 would be
 
[2,
 3,
 [4, [2]],
 [6, [2, 3]],
 [8, [2, [4, [2]]]],
 [12, [2, 3, [4, [2]], [6, [2, 3]]]]]
 
[2, 3, [4, [2]], [6, [2, 3]], [8, [4, [2]]], [12, [2, 3, [4, [2]], [6, [2, 3]]]]]
 
^^^ ast of 24
 
10:35 AM
Whoa nelly
 
@Tux I'll create a divisor tree program for your lang
 
Is there a challenge for that?
That looks pretty kule
 
if i find a way to program in it, i will outgolf literally everyone anyway
becuz a thing like 1986342482 is shorter than any golfing language for a complicated challenge
 
@TùxCräftîñg Divisors seems like a crap name though
No offense
 
name idea so?
 
10:37 AM
Ummm
I'll get back to you
 
@TùxCräftîñg a memory based memory model... what a descriptive term
 
addresses are absolute
instead of tape based where addresses are relative
 
@MartinEnder Ah, neat
 
@TùxCräftîñg Left a comment on the poll. :3
 
Anonymous
@GLASSIC Usually by directly writing to 0xB8000 (the memory location where the VGA text buffer resides). You have to be in text mode (or using an application that emulates a tty).
 
10:39 AM
@Mego I really liked ur TIO implementation... I have to refactor it though, to avoid that apache dependency rip
 
well, it's a tie for now
 
We're going to add an easy export to TIO feature to allow support for essentially all the languages, and your code is going to help
I do appreciate it.
 
Anonymous
@RohanJhunjhunwala Trying to do any sort of HTTP request in core Java (without Apache) is infinitely more painful than just relying on the Apacha dependency.
 
@Mego ok, I'll try to download the apache jar and add it to my build. It'll be an interesting experience, as I never have really added dependencies
 
Anonymous
In fact, it's so painful that, aside from using Apache's library, the best method is to exec a script in another language (like Python) that does HTTP requests in a much saner way.
 
Anonymous
10:42 AM
@RohanJhunjhunwala What IDE are you using?
 
@MartinEnder I think you forgot the test that there must be at least 1 jar with a volume greater or equal to the target
 
well, i think it's only possible to create 2-instruction programs :/
 
Anonymous
 
Anonymous
ಠ_ಠ
 
+1 for upgoat/downgoat xD
 
Anonymous
10:45 AM
Whoever voted to undelete that garbage needs to stand in the corner and think about what they've done.
 
@TùxCräftîñg Screenshot the entire question, (regardless of undelete votes), and put it up on GemsFromStackExchange. :P
whoops wrong person
sorry Mego
Also, user 60000 :D
 
^ someone should be the tiebreaker
 
I'm sadly not, because I chose all of the above.
 
well, tape of stacks
 
10:51 AM
:D
And a small amount of memory, too.
 
and a memory array to store temporary values (to transfer between multiple stacks for example)
 
protip, for your number lang, use the whole byte, including unprintables, for numbers to make golfier
 
no, it would be unfair for golfing languages :P
more seriously, yeah, it's a good idea
 
@TonHospel oh good catch, thank you
 
if the commands are divisors, how do you determine commands for all primes?
 
11:03 AM
i will take the prime number and % it to the max number of commands
ie the command associated with 5 is 3, becuz 5 is the 3th prime number (2, 3, 5)
 
Fixed it, but it cost 11 bytes. :/
 
11:16 AM
55 increment the pointed tape pointer and increment the pointed cell
 
@MartinEnder It's what complicated my solution too :-)
Perl has no variable width lookbehind
 
@DestructibleWatermelon Idea for divisors-based lang: allow the user to use multiple numbers, with their representative programs concatenated into one big program.
 
So now I only have messy solutions that make me unhappy
 
@TonHospel you could do it with an nested negative lookahead or something, but that's probably not going to be shorter, is it?
 
@zyabin101 this would make programming much simpler
 
11:27 AM
But with ONLY ONE number, it's impossible to enumerate every possible program.
 
ah it doesn't even need to be nested
 
@TùxCräftîñg What's your goal?
 
never mind...
 
@zyabin101 it's possible. it would just need a quantum computer and passing through some mathematic laws :P
 
11:28 AM
XD
But we don't have any of the above.
 
¯\_(ツ)_/¯
984
divisors.rb:104:in `step': failed to allocate memory (NoMemoryError)
        from divisors.rb:136:in `block in run'
        from divisors.rb:135:in `each'
        from divisors.rb:135:in `run'
        from divisors.rb:98:in `step'
        from divisors.rb:136:in `block in run'
        from divisors.rb:135:in `each'
        from divisors.rb:135:in `run'
        from divisors.rb:98:in `step'
        from divisors.rb:136:in `block in run'
        from divisors.rb:135:in `each'
        from divisors.rb:135:in `run'
 
oh maybe put the target volume at the front and replace the atomic group with a lookahead. ^(?=(1+)(,?\1)+$)(\1+),(?=.*\2)
 
@TùxCräftîñg Core dumped.
 
i have a file with the status of the tape of the first 983 programs
 
Mmmmm, that food really hit the spot! @ { o<==
 
11:32 AM
1
A: Connect the pixels

DanTheManALPACA, 414 + 2 = 416 bytes neighbourhoodV(^ v < >);states" ";statep"#"toA when4inV p,toB when3inV p andvs,toC when3inV p and^s,toD when3inV p and>s,toE when3inV p and<s,toF when2inV p and>s andvs,toG when2inV p andvs and<s,toH when2inV p and<s and^s,toI when2inV p and^s and>s,toJ when^p orvp,t...

^ this need more upvotes
 
still broken. now it works ^(?=1+,(1+)(,?\1)+$)(\1+),(?=.*\3)
only two bytes longer than the lookbehind solution
 
11:47 AM
@Mego thank you for your answer. i'm doing the same but i don't know why it just doesn't work. i've read the format of text to put there from wikipedia . could you tell me why this doesn't output anything ? also the guy here is trying to write it to segment b700 . maybe to put all un"seeable" junk like black fg in black bg . but i haven't calculated yet.
 
bbabacback
 
@DJMcMayhem Why on earth does this have an undelete vote?!?
 
wat
y do it hav a undelete vote ಠ_ಠ
 
^
But screenshot the post, for mortals? :3
 
@Mego i did it . i don't know why it worked . also b8000 itself is not a part of text buffer . it's just the byte before that if i'm not misunderstanding .
 
11:57 AM
@zyabin101
 
@trichoplax it appears that editing a deleted question automatically casts an undelete vote
 
Thanks :3
^^
@TùxCräftîñg that might be the reason someone undelete voted it.
And not just someone, the Community spirit.
 
alternatively, there's a possibility that you can always vote to undelete your own questions, regardless of privileges
 
@MartinEnder Either way, it's not evidence of the community being split on whether that should be deleted, so I'm happy again now...
 
12:03 PM
It appears they've gone out of the way to make five as hard as possible, and it's funny. :3
 
12:13 PM
time to make a turtlèd primality checker I guess?
I would get the five.js library, but I don't use js
bugs!
in my interpreter
augh
 
well, at least technically it produces the correct output in tryitonline because stderr is not outputted, and the bug only affects outputting nothing ¯\_(˚~˚)_/¯
 
plz stop ur fancy smileys
i dont have it ;_;
 
NO ¯\_(˚O˚_/¯)
 
;________________;
 
12:24 PM
T_T - I see it as a disapproving face, not a crying face
 
ಠ_ಠ
question: do a SE answer md sandbox exists?
 
Formatting?
 
If you just want to see how some markdown will be rendered, you can start writing an answer and then just not post it
 
I just don't get why there are so many people who ask general programming questions here.
 
ah ye forget about this
 
12:30 PM
@Qwerp-Derp PPCG or TNB?
 
PPCG
 
401
Q: Formatting Sandbox

Ólafur Waage As per Jeff's suggestion in this comment: You can use this question as a formatting sandbox. You can edit this question itself (Community Wiki questions such as this one require 100 reputation to edit) post answers to this question (Since this question is protected, this requires earning 10...

But this requires 10 actually earned reputation on Meta Stack Exchange.
 
It's nothing about the name being confusing - every site in the network gets completely off topic questions. It's something to do with being accessible to the public
 
130
A: Formatting Sandbox

Jeff MercadoStarting to rebuild the castle for modern times. Looks decent on FF so far. full block: |        | <kbd>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</kbd> half block: | | <kbd>&nbsp;</kbd> extra block: |               | <kbd>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&...

its epic
 
Beautiful.
 
12:33 PM
 
2
Q: Is it a balanced number?

Weeing If FirstA number is balanced if the sum of the digits on each half of the number is equal, so: 1 4 2 3 is balanced because 1+4 = 2+3, so is: 4 2 6 1 5 because 4+2=1+5. Take a positive integer as input, and output a truthy value if it's balanced and a falsy value if it's unbalanced. Test cases (true) ...

 
u r evil
ಠ_ಠ
 
@zyabin101 You horrible man.
 
That's the joke :D
The progress roller is the joke XD
But
Double bonus: you can get sick staring at that for 2 minutes. — uɐɯsO uɐɥʇɐN Dec 8 '11 at 5:54
 
12:40 PM
89
A: Formatting Sandbox

BlenderUp up and awayyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy Bzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz Down down and belooooooooooooooooooooooooooooooo...

WHAT THE ASDF
 
@trichoplax Reminds me of the time that I was reading a deep technical article somewhere on TechNet about (I think) connecting an Exchange server to users in a different AD forest ... and in the comments and feedback section at the bottom was someone asking how to update their sound card drivers because this game that their son wanted to play kept crashing.
 
Wow.
 
12:55 PM
0
Q: Is it a balanced number? (alternative)

Basically Alan TuringInput An integer or an acceptable alternative Output A truthy or falsey value based on whether the number is balanced or not. A number is balanced if: It has an even number of bits When the binary representation of the number is split down the middle, the result is symmetrical. Example I...

 
247
A: Is the Stack Overflow source code available?

Andreas BoniniAfter having given much thought to it during the last 2 years I decided that yes, I will release the stack overflow source code. Here it is: static void a() { a(); } int main() { a(); }

._____________.
 

« first day (2064 days earlier)      last day (2780 days later) »