« first day (2332 days earlier)      last day (2491 days later) » 

11:03 AM
I copied one file to another folder and Windows' WM died
11:21 AM
@Doorknob Ever used corrode? Is it actually useful as a starting point for bigger C projects to transition to Rust?
Hmm should I implement slicing in Charcoal?
@mınxomaτ Sorry, I wouldn't know, having never used it.
@ASCII-only hmm...
11:46 AM
Q: C program that uses entire x86 instruction set

user3707023Write a compact, yet pedagogically useful, C program that uses the entire x86 instruction set. The purpose is to make something that is useful for understanding C, assembly, the x86 instruction set, and the relationship between them. The program that strikes the best balance between compactness a...

@NewMainPosts With the amount of inline assembly required to use all the instruction idk if it will still counts as a C program lol
And also the x86 ISA has a lot of versions and extensions so it's unclear on that
@NewMainPosts sorry but pedagogical value is not an objective winning criterion
it's a subjective winning criterion
and subjective means can't be easily decided who will win
12:19 PM
If you require a strict output format then you get downvotes. BUT if you tag kovlogmihfihief complexity everything is fine
umm...that complexity is how complex is to name a complexity?
1:03 PM
:D I managed to make a bigger number and golfed my code down by one byte!
A: Largest Number Printable

Simply Beautiful ArtRuby: score is approximately (much greater than) fω²+ω(126) where fα(n) is the fast growing hierarchy. Assuming online interpreter where printing the result is automatically done: New entry: def f(a,b=-a,c=a,y=?!.ord)a.times{a+=(c>y)?f(a,b,c-y):(b<-y)?f(a,a):(b<y)?a:f(a,b-y)};a end;f ?~.ord ...

@SimplyBeautifulArt I love ordinals...
@Mr.Xcoder That's cool. I'm interested in the construction of large computable ordinals
Do you think that a Googol to the power of another Googol can be ever written down (by hand) if you would dedicate you entire lifetime to it?
Q: Smallest C program that uses the entire x86 instruction set

user3707023Create the smallest program that uses the entire x86 instruction set.

@Mr.Xcoder Nah. You don't have enough atoms in the observable universe
1:09 PM
@NewMainPosts BUTTER
The observable universe has approximately 10^80 atoms last time I checked
@SimplyBeautifulArt sorry for the typo
@Mr.Xcoder still too big to write down
@SimplyBeautifulArt The observable universe is kind of small, you know :))
@Mr.Xcoder it's bigger than the amount of paper I can write on within my lifetime
1:11 PM
True as well.
@Mr.Xcoder Whats the largest finite number you can name?
@SimplyBeautifulArt not mr. but I think that there's no real answer to that
@SimplyBeautifulArt Irrelevant... But what I can name...
(the largest finite number I can name) + 1 is my answer
1:14 PM
Okay then. What's the largest number you can name in two minutes using only one chat message.
@EriktheOutgolfer :|
(the largest finite number I can name in two minutes using only one chat message) + 1
(Googolduplex + Googolduplex + Googolduplex + ...) * 2 minutes
Hm... I need better rules...
go to recreational math games maybe?
If I suddenly won't respond to one of the messages, or it will arrive after 5 mins or so, It's because of my Internet connection
1:17 PM
you think you have a bad internet connection?
Yes, I do.
I have even worse than that I think...
It's working 10 mins and dropping 15 mins/
mine randomly drops for no reason...and I have to go to the modem and restart it...
not to mention my speed is 12mbps
@EriktheOutgolfer Me too!
1:19 PM
but do you have 12mbps?
Mine is 9mbps :))
ooh...that's even worse than mine
@Mr.Xcoder Googolyottaplex
is there any mathematical notation (in ordinal set theory) that restricts adding ordinals beyond it (some kind of barrier)
1:22 PM
I mean, something you are not allowed to place ordinals after (the last ordinal or sth like this)
There is no last ordinal AFAIK
Every ordinal is supposed to have a successor
umm I don't think that's a correct link
1:24 PM
How can one define an inaccessible cardinal?
@SimplyBeautifulArt Thanks, couldn't find a helpful article so far :))
@Mr.Xcoder You know the fast growing hierarchy?
Let me think of a possible translation in my language, it's hard to think in English :))
No, I don't really know much about it @SimplyBeautifulArt
Its a quick way to turn ordinals into extremely large finite numbers
My code above more or less implements the fast growing hierarchy (sort of)
def f(a,b=-a,c=a,y=?!.ord)a.times{a+=(c>y)?f(a,b,c-y):(b<-y)?f(a,a):(b<y)?a:f(a,b-y)};a end;f ?~.ord
1:34 PM
CMC: Output a Googol (Code-golf)
Nah, that's no fun
Output something larger than Graham's number
Nah, that's too fun :)
@Mr.Xcoder yeah no fun at all, Jelly 4 bytes: ȷ100
1:37 PM
or even 3 bytes: ⁵*³
Q: Shortest terminating program whose output size exceeds Graham's number

r.e.s.Write the shortest possible program (length measured in bytes) satisfying the following requirements: no input output is to stdout execution eventually terminates total number of output bytes exceeds Graham's number Assume that programs run until "normal" termination on an ideal computer1 abl...

5*3 = googol
This gets really boring: No one posted a good challenge in over 10 hours!
PPCG is so slow nowadays.
1:40 PM
@Mr.Xcoder yeah, and most challenges are posted when I'm asleep
@EriktheOutgolfer Same here
wait where do you live?
Romania (UTC +2)
oh...I'm in Greece (UTC+2+1)
1:42 PM
Perhaps if this doesn't bore you more, code the largest number you can under these rules with the exception that you can use numbers and only linear operators.
The summer hour is EEST (UTC +3) actually
and the winter EET (UTC +2)
@SimplyBeautifulArt so +-*/?
@Mr.Xcoder ooh same timezone
@EriktheOutgolfer Yeah, pretty much
that's called elementary arithmetic
@EriktheOutgolfer cool
1:44 PM
and of course can be reduced to -/
I am nearly done with my programming language
The syntax is awful
Full codepage:
does anyone here know why these case statements produce diffrenet results in ksh?

a=$(printf \\x00);
case $b[1]${#a} in *1*)echo 50;;*)echo 58;;esac
case [1]${#a} in *1*)echo 50;;*)echo 58;;esac
echo $b[1]${#a}|hexdump -C --
echo [1]${#a}|hexdump -C --

"ƒ" : "for N in ",
"∑" : "while ",
"ˆ" : "if ",
"´" : "else:",
"`" : "elif ",
"¥" : "True",
"˜" : "False",
"»" : "read()",
"Æ" : "readInt()",
"«" : "write(",
"ß" : ".split(",
"Ω" : ".split()",
"œ" : "excludeFromString(",
"π" : "pi()",
"ë" : "e()",
"∫" : "feigenbaum()",
"©" : "sum(",
"®" : "reduced(",
"µ" : "map(",
"≈" : "filter(",
"^" : "isSqure(",
"√" : "sqrt(",
"†" : "str(",
"¬" : "list(",
"∞" : "range(",
"ø" : "len(",
"fi" : "nthFibonacci(",
"fl" : "firstNFibonacci(",
"ç" : ".count(",
"∂" : "del(",
Hi there
What do you think ^^^
1:49 PM
@Mr.Xcoder The integral should be a real integral
They're not very related ... Just put those all in there @SimplyBeautifulArt
Any challenge ideas?
@Mr.Xcoder if I had any I would have posted it
I really want to make a new one related to strings, but I do not know what to start off with.
2:00 PM
I haven't posted any challenge since 6 days ago.
@LeakyNun I know that... But maybe someone else has ideas but is too lazy to put them all together right now
@LeakyNun actually 7
@WheatWizard ^ you've been working on it since last year.
I haven't been on the site for a year
I should do that though
@WheatWizard why non-competing?
Have we abolished non-competing yet?
Are challenges where people are supposed to choose between two / three tasks off-topic?
Is there any meta consensus on that?
such as "nth element in series, or first n elements in series, or the entire series as an infinite stream"?
2:37 PM
@JanDvorak Yes, kind of... I changed my mind anyways, forget it.
who abused stars again?
2:54 PM
Q: What to do about BBC micro:bit?

caird coinheringaahingBBC micro:bit is a piece of hardware wich allows to to run code, such as Python or Javascript, that is custom made for the micro:bit chip. However, it in itself is not a programming language. Instead, it allows people to use 4 different coding languages to manipulate it: Python, with a custom ...

3:32 PM
Q: How do we count bytes in BBC micro:bit languages?

caird coinheringaahingBBC micro:bit is a piece of hardware wich allows to to run code, such as Python or Javascript, that is custom made for the micro:bit chip. However, it in itself is not a programming language. Instead, it allows people to use 4 different coding languages to manipulate it: Python, with a custom ...

A: Sandbox for Proposed Challenges

Mr. XcoderLet's learn some Chemistry! chemistrycode-golfkolmogorov-complexity string Andrew is a chemist, interested in the acidity of solutions. After months of research (Google is not his friend), he came up with the following table* regarding the human-readable level of acidity in terms of the pH (pote...

3:52 PM
A language with the memory on a beehive layout
@totallyhuman that sounds like an interesting idea. reminds me of hexagony (but I think that's IP movement)
Hello World
darnit I regret not using sympy in my programming language from the start, now I will have about 100 bugs after switching
Where does PIP install modules?
in the installation directory for python
you can import the module and do module.__file__
and that will return the file of the module
A: Sandbox for Proposed Challenges

xyz123Only HeLlO WoRLd is allowed. We are all familiar that "Hello World" is the 1st introductory program that most people learn when they first start to program. Then programmers go on to greater and better programs. But who says they have to go on to greater and better programs? What if all other pr...

4:22 PM
although i currently have no idea on how i would implement that
hi all
Say you have n numbers in an array, and you want to compute the product of every subset of size n -1
you can do this easily by multiplying all the numbers together and then dividing by each one in turn
find the total product and divide that by each element
darn you ninja'd me :(
4:26 PM
but how quickly can you do it if you don't want to do any division?
that is what is the minimum number of multiplications?
n²-n I'd say
so O(n²)...
CMC: Given an array, compute the array of products of each subset with one less element such that the element-wise product of the two arrays has all equal elements.
Jelly, 2 bytes: P:
"CMC: Given an array, transform each element to the product of the other elements"
4:29 PM
@EriktheOutgolfer I think that might be pessimistic
I think that's how O works though
@LeakyNun Yeah that's a lot more clear :P
I believe that O(n) is possible but I have no idea how.
@LeakyNun already posted
I believe so because I have seen a challenge requiring O(n)
4:30 PM
@EriktheOutgolfer I mean I think O(n) might be possible
@LeakyNun cool
@LeakyNun Take product of entire list, for each element divide the large product by that element.
I think it's possible with division allowed but I don't think so otherwise.
@Phoenix ninja'd twice lol
Runs in 2N
@Phoenix yes I want to do it without divisions
4:30 PM
@Phoenix what if there is 0?
forgot about that
@HyperNeutrino I literally just joined, sorry.
then replace /x with /(x or1)
an O(n) algorithm would be "divide large product with each element"
4:31 PM
@Phoenix lol it's fine just saying that you were ninja'd :P
Jelly, 2 bytes: P:
@EriktheOutgolfer also ninja'd
is more accurate but P: works as well for integers.
is more prone to eternally damning floating point errors...:(
Then use M
4:34 PM
(the programming language)
CMC: Convert each element of an array to the running product up to the element. That is, the product of every element left of it and itself from the original array.
@Phoenix Jelly, 2 bytes: ×\
I think
Jelly, 4 bytes: ;\P€
4:36 PM
lambda l:map(lambda a:reduce(int.__mul__,l,1)/a,l)
from itertools import*
no algorithms loving people in ... :(
@totallyhuman replace lambda x,y:x*y with int.__mul__
or float.__mul__
@HyperNeutrino nope
Oh wait I typed a x and not a ×
@Phoenix yes
4:37 PM
@totallyhuman why do you need itertools
for reduce()
no that's functools not itertools
maybe it could be a fastest-algorithm challenge
4:38 PM
oh wait py3 doesn't have reduce
wait reduce is right-to-left???
@totallyhuman that's Python 2 btw
oh wait
i'm an idiot
It doesn't return the correct result.
@HyperNeutrino you can import functools.reduce
4:40 PM
@HelkaHomba I meant as a builtin
>.> python's modules
Not as bad as Java packages
import org.apache.commons.lang3.*
>>> True, False = False, True
>>> True
>>> False
i love how python2 rolls with anything
You can redefine None in Python 1
this kid has some strange ideas about work
4:43 PM
@HyperNeutrino Make a Python 3.1415926... that just has all the standard libraries imported by default.
> I am not doing any work and you are implying that I won't get 50% of money
@HelkaHomba Why just the standard ones?
lambda l:map(lambda a:reduce(int.__mul__,l)/a,l) updated
@HelkaHomba ಠ_ಠ why...???
4:44 PM
@HelkaHomba Pi-thon?
I just want a java with java.util.* imported by default.
@Phoenix I mean docs.python.org/3/library, but throw numpy &c. in there too
@totallyhuman I think you might be better off with array comprehension over map
@HyperNeutrino everything will be at your fingertips for golfing
4:46 PM
@Phoenix unless you have a built-in method, using list comprehensions is almost always better than mapping :P
@HelkaHomba that actually doesn't sound like a terrible idea until naming conflicts
@HelkaHomba That's what I meant too, why not include numpy and such.
ಠ_ಠ you guys are too golfy for me
@HelkaHomba webbrowser.open and open will conflict I'm afraid, unless you keep namespaces as-is
and the latter is more useful...but the former will take over...
4:47 PM
Let's keep it at import *, and not import *.*
  File "<stdin>", line 1
    import *
SyntaxError: invalid syntax
@Phoenix Why not both?
@HyperNeutrino lambda l:[reduce(int.__mul__,l)/i for i in l] same byte count
1 min ago, by Erik the Outgolfer
@HelkaHomba webbrowser.open and open will conflict I'm afraid, unless you keep namespaces as-is
4:48 PM
other conflicts possible too
@HyperNeutrino Obviously it doesn't work in native python, that's why we're discussing a new python.
oh ok lol
Ruby > python anyway lol
4:49 PM
18 mins ago, by Leaky Nun
@Phoenix what if there is 0?
CMC: consider the 0 case.
I don't think the running product changes
4:49 PM
@totallyhuman easier said than done
@Mendeleev I might agree if I could ever figure how to get a plain function in Ruby (and not call it) -.-
@LeakyNun lambda l:[reduce(int.__mul__,l)/(i or 1)for i in l]
there must be an O(n) solution I feel
@HelkaHomba What do you mean?
Yeah, just replace in the original array and multiply current element by previous element.
4:52 PM
shall I pose it as a fastest-algorithm challenge?
@Lembik which one, running or exclude?
@Mendeleev I guess I mean method(:f) to get the function object, as opposed to just f in python. Sometimes convenient but often weird that Ruby functions don't need parens
@HyperNeutrino sorry I am not sure what you mean
I only asked one question
@Lembik right sorry the other one was phoenix's sorry
4:54 PM
@Lembik is more appropriate...
@EriktheOutgolfer why is that?
@HelkaHomba There's always lambdas... I don't do functional programming very often
I am not restricting the complexity
@Lembik If you don't want to pose it, may I?
@Arthur sure!
4:55 PM
@Lembik because you want an O(n) solution, but will allow for the O(n²) solution...
@Mendeleev I do like how printing in ruby is just p. Saves ages typing
@EriktheOutgolfer no.. I want the smallest count of arithmetic operations
@EriktheOutgolfer if the winning entry is O(n^2) so be it
@HelkaHomba Unless output has newlines in it.
@HelkaHomba That's not printing. p x is basically puts x.inspect
4:56 PM
@EriktheOutgolfer it's not code golf!
puts x is STDOUT.puts x.to_s
@Lembik that's not what the tag means
could be code-challenge
I don't think?
but why not fastest-algorithm?
4:57 PM
You want smallest number of unique operations or smallest number of operations?
@Mendeleev I don't think it does. That seems to count the number of operations in the code
not the number of operations the code will execute
It can be adapted
but why not fastest-algorithm?? :)
it seems a perfect fit for that
you want lowest complexity or fewest operations?
former is indeed
4:58 PM
the word complexity is a little under specified
I mean big-O complexity
is fastest-algorithm really only in terms of big O() notation?
because asymptotic time complexity could include constants
you could specify that in the challenge...
that is the running time is asymptotic to 2n or 3n
those are different asymptotics

« first day (2332 days earlier)      last day (2491 days later) »