« first day (2238 days earlier)      last day (2616 days later) » 

4:00 PM
@Downgoat I do
 
@Downgoat meta.codegolf.stackexchange.com already redirects to the new URL, but IDK if it messes with the userscript
 
@Downgoat I use it
 
My browser doesn't have it turned on atm for some unknown reason glares at TamperMonkey
 
anyone else getting ERR_TOO_MANY_REDIRECTS with HTTPS Everywhere at codegolf.meta.SE?
 
4:02 PM
Hmm, TamperMonkey is borked in the latest Developer Edition of Firefox. Guess I'll just turn the userscript on in GreaseMonkey
...and there you have it, the userscript officially does not turn on at PPCG.meta.SE
 
@Mendeleev Not me as I don't use HTTPS Everywhere (Break Everything would be a better name), but I've heard about other users having the same problem.
 
@Dennis I actually haven't had much breakage. SE chat works fine, only problem is that some avatars don't load.
wait, since when does C++ have lambdas?
 
That would already be a deal breaker for me.
 
@Downgoat PPCG userscript should be fixed now
Oops... I enabled the main theme on meta
 
I guess I can make talk.tryitonline.net redirect to HTTPS now.
 
4:07 PM
@Dennis btw, I believe you are part of the PPCG organization on GitHub, is it possible to move the PPCG-design userscript there?
 
There's a PPCG organization?
Link pls?
 
There's a link in this room's description. >_>
 
@Downgoat I'll have to ask the others.
 
I nver noticed chatiquette was a github link.
Oh right, I can't use GitHub right now because the connection I'm on mangles security certificates.
 
4:11 PM
Can't you just visit the HTTP version?
 
0
A: Sandbox for Proposed Challenges

G BGolf that for me, please. As a lot of people can guess, I like using a particular language or two, or three, and I'm not into "golfing languages" (yet?), so it could happen that I do my best, find a clever solution to the particular problem in Ruby, or in C, then cut my variable names, wrap some...

 
OK, really fixed the userscript, for real this time.
 
Nope :|
Same security error
Oh, brilliant, I can't update my userscripts because they're hosted on GitHub
 
GitHub gives security errors
 
4:18 PM
@ГригорийПерельман ssh?
 
I don't really understand SSH. I just now it's the thing you can use to remotly control a computer?
 
ssh = secure shell
 
@Mendeleev since 11
 
Eventually, after years of updates, C++ will reach it's natural resting place and become C#.
 
I hope not. I'm not really a huge fan of C++, but there's a reason it isn't anything like C#
 
4:24 PM
TIL about user-defined literals. The endless fountain of features that is C++ never ceases to amaze me
 
C++ is a lot like C#. Isn't that why they called it C#?
 
That's really cool actually
@ГригорийПерельман They're nothing like each other at all
 
Well, it's closer to C# than anything else
 
Other than C-style syntax
 
One day they'll even have a garbage col... wait, they do???
 
4:25 PM
(C doesn't count)
 
@ETHproductions Oh yes thats a thing
(btw noone uses it when the matter is not readability)
@ГригорийПерельман Two reasons why its named C#. 1. #(sharp) is half-up in music, while C is a note
 
@ГригорийПерельман You can clone git repos through ssh
 
@ГригорийПерельман Try GitGoat :P /s
 
@ГригорийПерельман Reason 2: C# looks like ˋC++++ˋ
 
@ГригорийПерельман No, not really. C# is very high level, extremely object oriented and garbage collected. C++ is much lower level, somewhat object oriented, and manual memory allocation. Plus a bunch of garbage with templates and STL
 
4:29 PM
@Mendeleev Right, and I've tried that, but it is similarly borked.
 
because # has 4 + inside
 
C# is just a compressed version of C++
 
@DJMcMayhem But is there anything closer to C++?
 
@ГригорийПерельман If I'd choose one, I'd choose D.
 
4:31 PM
Yes, that language which noone uses
 
I'm not really sure beyond that. There isn't a huge demand for high level languages that are hard to learn and have a bunch of low level memory issues
 
@DJMcMayhem then explain PHP
 
Maybe Go and/or rust, but I've never used either so that's mostly a guess
 
Well, any language closer to C++ than D?
(Maybe lua with extern C++ XD)
Btw, is C closer to C++ than D?
 
Probably not, but I haven't used D so I couldn't say for sure
 
4:34 PM
Nobody has
 
From what I know, D tries to be largely compatible with both
 
@Downgoat Too expensive.
 
App is free?
 
Don't forget the cost of an Apple product
 
That.
 
4:40 PM
@JanDvorak you can probably find iPhone 3S for like only $500
 
That is a pretty awful price for an emergency phone with a github client
 
I don't think @Downgoat meant $500. That phone is ancient. Also, terrible.
 
@Downgoat iphone 4S for like $100
 
Yeah, $500 for the next gen would still be a ripoff
 
4:43 PM
@DJMcMayhem just get op3t
also, since when can you do this in C++?
#include <iostream>
#include <vector>
using namespace std;
int main() {
	vector<int> v = {1, 2, 3, 4, 5};
	for(auto i : v) {
		cout << i << endl;
	}
	return 0;
}
 
A while I think. Maybe 11, maybe earlier
I use that all the time, it's very nice
 
(1..5).map{|x|puts x}
 
@Mendeleev which feature, specifically?
 
for (auto I: v) I'm guessing
 
Meta is completely broken for me.
@ETHproductions auto i : v
 
4:45 PM
Huh, interesting
 
@Mendeleev just kidding, I looked it up. It's definitely an 11 feature
 
@JanDvorak puts *1..5
 
Technically auto is also
 
That would use commas, not newlines.
 
@JanDvorak no
irb(main):001:0> puts *1..5
1
2
3
4
5
=> nil
 
4:47 PM
Oh, right, sorry
 
@Mendeleev C++ has had enhanced for loop for a long time
 
I was thinking puts [*1..5]
 
irb(main):002:0> puts  [*1..5]
1
2
3
4
5
=> nil
 
@Downgoat if 6 years is a long time
3 mins ago, by DJMcMayhem
@Mendeleev just kidding, I looked it up. It's definitely an 11 feature
 
So essentially it's been there twice as long as I have been programming
 
4:51 PM
Sure, but the language has been around for over twice as long as you've existed
 
2 mins ago, by Mendeleev
irb(main):002:0> puts  [*1..5]
1
2
3
4
5
=> nil
 
@Mendeleev huh... TIL
 
At least I think. I don't know exactly how old you are
 
AFAIK arrays get puts'd as separate lines
 
@Mendeleev and that's because Ruby treats them as an enumerable right? So it is effectively puts 1 puts 2 ... puts 5.
 
4:54 PM
@fəˈnɛtɪk AFAIK yes. The Ruby Enumerable mixin is very powerful.
Testing:
(•◡•)/
@ATaco Your userscript works
 
@ATaco what happens if a number has an argument in TacO?
like this: @p14
Would it print 1 and then 4?
or just 1?
 
And sorry for being so damn pedantic, @ATaco, but it is Aperture, not Apeture
Also, what does @pp1 do? what arguments does p return, if any?
 
The Wikipedia disambiguation page for Aperture doesn't link to Portal. Boo hiss.
 
...Maybe I should try these online.
 
5:05 PM
Idea: programming language where all numbers start with two, then you use operators mdas to modify it
 
Good News: Looks like GitGoat isn't crashing that much. Bad News: GitGoat is crashing a lot so something somewhere is very wrong
 
Nevermind, all my questions were answered
 
like the number 42 would be 2mmmm-2mm-2maa
 
@Mendeleev I actually had an idea like that a while ago, called 7, where all you could do to manipulate data was add, subtract, multiply, or divide by 7
 
Hey I was going to post a question from the sandbox. Could I get some last minute advice?
 
5:06 PM
@ETHproductions Ehh
 
0
A: Sandbox for Proposed Challenges

Wheat WizardEscape You find yourself on a chessboard, as one does. You can see the exit but it is awfully far away and you would rather not walk all the way. Luckily some locals have offered you a ride. A knight, a rook, a bishop and a king are all willing to take you to your destination, but seeing how t...

 
2 is more better-er
 
I planned more and more features until it was practically a golfing language that could only use numbers :P
I never implemented it though
 
@WheatWizard in the second test case, is there a reason the two parts of the board are split?
 
@Downgoat It is to show that knights can jump over gaps
 
5:08 PM
@Mendeleev Interesting, but I'm not quite sure how it works
2mmmm = 32?
 
no
2*2*2*2*2
 
@WheatWizard oh I see
 
m = *2
 
Should I make that clearer in the question body?
 
exactly, that's what I thought
 
5:09 PM
m = *2, d = /2, a = +1, s = -1
Basically the SIOC but starting with 2
 
Oh, that makes more sense
 
@WheatWizard yeah, that would be helpful, additionally I think perhaps a test case describing one of these:
> If multiple pieces can make it to the destination in the same number of moves you must output all of the pieces that can get there in the minimum amount of time. If none of the four pieces can make it to the end you may output anything as long as it is distinct from all other possible outputs
 
@ETHproductions Isn't there already this
 
otherwise it looks great
 
@Downgoat Ok will do thanks
 
5:10 PM
> created toward the end of 2016
I thought of my version of 7 mid-2015
But yes, now there would be a name conflict if I tried to implement it
 
Anonymous
You could name it 7even and confuse people with the movie
 
btw @ETHproductions I was thinking about this yesterday, but will Crayon be based on drawing at a specific coordinate/location on the canvas, or more like Charcoal?
 
Not sure what Charcoal's like, but your first description seems pretty accurate
 
@Mego seveneven?
 
Charcoal member here. We don't draw anywhere. We pick up trash using heavy weaponry.
 
Anonymous
5:13 PM
@JanDvorak Wrong Charcoal
 
Anonymous
Charcoal is also a language for doing ASCII art
 
Nope. Our charcoal is perfectly good.
 
Anonymous
I'm also a Charcoal member, remember?
 
oh... right :-)
 
What is this other Charcoal group?
 
Anonymous
5:15 PM
Wait am I thinking of Crayon?
 
@JanDvorak So a tpu is the equivalent of a rocket launcher? :P
 
O/ another charcoal member reporting in :)
 
@Mego isn't the movie se7en?
 
@Mego Charcoal's the one that's been mostly implemented, Crayon's the one that hasn't
 
5:16 PM
@Doorknob sounds appropriate :-)
 
Anonymous
@fəˈnɛtɪk Yep
 
@ETHproductions Automated SE janitorial tools
 
Oh, right
 
Anonymous
@ETHproductions Ah right
 
Anonymous
Charcoal keeps SE relatively spam-free
 
5:16 PM
For low-orbital nuking
 
Anonymous
We have orbital ion cannons and lots of flags
 
Anonymous
I considered keeping the typo
 
It's also how I got 1600 helpful flags across SE. :)
 
@DJMcMayhem No kinetic bombardment? Nukes leave harmful fallout.
 
@ATaco Is there a way to take input in TacO?
 
5:26 PM
@flawr I keep recalling this quote of yours lately :-)
@fəˈnɛtɪk I'm curious. Why "fəˈnɛtɪk" instead of "fəˈnætɪk"?
 
phonetic, as in International Phonetic Alphabet
 
Ooh
I thought it was "fanatic"
"Phonetic" makes more sense :-)
 
5:51 PM
@fəˈnɛtɪk that's actually a pretty cool name
 
6:04 PM
@fəˈnɛtɪk What are the 297 and 2040 figures for exactly?
I couldn't quite tell what "unique arrays" referred to
 
Holy dang, 641 updoots on that GoL Clock answer.
 
They are all the combinations with no repetition ie (0,0,0,0,0),(0,0,0,0,1)...
 
@fəˈnɛtɪk Oh I see.. I know some more in that case
n=3 gives 48
n=4 gives 297
n=5 gives 2040
n=6 gives 15425
n=7 gives 125232
n=8 gives 1070553
 
my solution times out at generating the adjacency matrix for 5 on TIO. Probably because the matrix has 60 million entries.
 
you just need to iterate over all 2^(3*n-1) pairs of strings and add the Hamming distance array to a set
nothing more
 
6:12 PM
Greetings. :)
 
o/
 
6:27 PM
1
Q: How do I get there?

Wheat WizardEscape You find yourself on a chessboard, as one does. You can see the exit but it is awfully far away and you would rather not walk all the way. Luckily some locals have offered you a ride. A knight, a rook, a bishop and a king are all willing to take you to your destination, but seeing how t...

 
> as one does
3
 
@Lembik I added a piece of code which shows which nodes were selected and what nodes they would conflict with. It only shows the hamming distance arrays that were generated.
 
7:17 PM
> You have not only demonstrated that violent criminals aren't a problem, you've demonstrated why as well. What with all the traffic, hailstones, tornadoes, hurricaines, thunderstorms, blizzards, droughts, bears, wolves, rattlesnakes, dogs, alligators and whatnot, criminals don't hang around there because it's far too dangerous! -- source
 
The weirdest sorting program I've ever written
 
What's with the space?
 
It's necessary
 
I'm shocked
 
@DJMcMayhem I was just thinking "Gosh that MATL code could pass for V... V - TIO Nexus"
 
7:24 PM
Necessary whitespace in a golflang ... what's this world coming to.
 
@KritixiLithos hahahaha
A cookie if you can explain how it works 🍪
 
Magic
 
@DJMcMayhem Ooh, you ROT13 to get :sor n and then execute it
 
@KritixiLithos 🍪 🍪 🍪
 
Chocolate chip cookies, my favourite!
 
7:37 PM
Surprise! They're oatmeal raisin.
 
belated pi day at work today
since tuesday was a snowstorm
mmm pie
 
Ohh so much snow
Brutal commute home during that
 
@Riker this is awesome :D
 
@MistahFiggins The i function gets the command line arguments, no way for STDIN yet though.
 
7:53 PM
> *Playing with a Ouija board* "Sprits, are you there? Can you hear us?"
*Ouija board moves* "New board, who dis?"
 
@LuisMendo Well I got that enlightenment from an wise ancient entity, so it must be true.
 
> Welcome to the intergalactic soul network. Please wait while we complete your registration
 
Can anyone help with Tomato development? It's on GitHub
 
Does a language need to have infinite loops to be TC?
 
Not necessarily, but it certainly makes the possibility easier.
 
7:57 PM
you need conditional logic and looping of some sort
 
So finite loops are enough?
 
so it's likely that infinite loops should be possible
 
If you have truly unbounded memory, but no infinite loops, you can still be TC, I think.
 
TacO can determine primacy, but not implement a truth machine.
 
So technically, if such a language were to exist (that is without infinite loops) solving the halting problem would be trivial
 
7:59 PM
TacO seems to satisfy all other requirements, and such it has itself a solved halting problem.
 
@KritixiLithos "Solving the halting problem" isn't an issue. Any programmer worth their salt can see a program and an input and tell you if it halts or not. Coming up with a general algorithm to do so is what's impossible.
 
@AdmBorkBork Not really. May I give you some Ruby code?
 
I'm not a Ruby programmer, and I am by no means worth my salt.
;-)
 
No true Scotsman fallacy with a speck of ad hominem? :-D
 
8:02 PM
@AdmBorkBork Can the "general" algorithm apply to a specific language?
 
Anonymous
Code Jam registration is open
 
I am planning to try out Röda for the Code Jam
 
@KritixiLithos Kinda? Not really? It's more mathematical than programmatical.
@JanDvorak Is it ad hominem if I attack myself?
 
There's a lot of splash damage
 
@AdmBorkBork So to sum it all up, solving the halting problem for a specific language isn't solving the halting problem because you have to have a general algorithm for a general set of languges
 
8:08 PM
Right. I mean, you could make a language that only ever executes for 10 seconds, no matter what the input or actual code is. Obviously solving the halting problem for such a language is trivially easy.
It may not be a very functional language, and it may not be TC, but it is still a language.
 
@AdmBorkBork But in the case of the 10 second language, it would be unlikely that it is TC
 
Right.
I wouldn't want to say impossible, because I haven't gone through the proof, but I would be absolutely shocked if such a language was actually TC.
 
@AdmBorkBork I was talking about solving the halting problem for TC languages (since as you have mentioned, solving the halting problem for non TC languages will be trivial)
 
OK, but solving the halting problem is impossible.
 
What does "general" exactly mean?
 
8:13 PM
Non-specific, arbitrary
You can construct a halting algorithm that can take in a particular set of inputs and a particular set of code and give a 100% yes-or-no answer for each. No problem.
A general algorithm for all input/program pairs can't exist.
 
@AdmBorkBork well, there is a problem... :^)
 
Implementation is left as an exercise for the reader.
 
@AdmBorkBork But that doesn't exclude all input/program pairs for a specific language
 
Yeah, it does, if the language is TC
Because that would mean that you've got all input/program pairs for a Turing Machine.
 
Could you please restate that?
 
8:22 PM
If your language is Turing Complete, that means that there is some way that it can simulate a Turing Machine. It may be very convoluted, and it may take a gigantic amount of processing power or time to do so, but it can be done.
That means that there's a way to translate any program in your language into a corresponding TM.
Which means that, even if the method to do so is very ugly, you can translate all input/program pairs for your language into input/program pairs for a Turing Machine.
 
Isn't a TC language a TM?
 
Turing Machine is a very specific mathematical model of computation.
It provides a way of formalizing "computing" into terms that can be used in proofs.
In practice, programming languages and computers are linear bounded subsets of a Turing Machine, because we don't have infinite memory and infinite time in the real world.
 
@flawr Hm, which entity? I'm curious
 
@LuisMendo Probably the spirits of MATLAB XD
 
8:31 PM
Haha, ok
 
@KritixiLithos I think by (one) definition a TC language is one than can simulate a TM (ignoring physical memory limitations)
So yes, effectively
 
@AdmBorkBork So you're saying that (in simplified terms) in order to be able to solve the halting problem for language X, you also have to be able to solve it for language Y, Z, ... because language X can simulate the other languages
 
Pretty much. And since it's been proven impossible for a general Turing Machine, it's also therefore impossible for any TC language.
 
@KritixiLithos If you can solve Halting Problem for a language X, you prove it at the same time for all equivalent languages Y, Z, ...
Because you can translate any Y program to X, you don't need to solve it for Y.
I'm really waiting for the announcement of a new physical theorem that disproves the Church-Turing thesis and enables us to do infinite number of calculations in finite time. It's going to revolutionize computing. After then, even the Solution of the Halting Problem will turn out to be a simple and elegant program.
 
@fergusq Hmmm interesting thought
 
8:37 PM
@fergusq Quantum computing and superpositions.
 
Unfortunately, in my understanding, the current quantum computers are TC equivalents, just faster than traditional processors.
 
We have to change our idea about what an answer means, though.
 
@fergusq The current quantum computers are exactly the same as general QC, but with a minimal qbit count. Degradation and sheer physical scale are a problem right now.
 
@fergusq This reminds me of one of VSauce's video. If a lamp were to switch between on and off an infinite number of times in a finite amount of time (say 2 minutes and the time taken for the lamp to switch state halves each time, starting at one) what will be the state of the lamp after the finite amount of time?
 
If you mean DWave, that's not a general quantum computer
 
8:41 PM
Wait, quantum computers exist now?!
 
sorta
 
Depends upon your definition.
 
@KritixiLithos I think that these "infinite" programs will still have exit states. There is just an infinite number of calculations before the program halts.
It would be an error for a program to have an ambiguous return value.
 
@KritixiLithos Low qbit ones have been here for a long time. You can even use one here: quantumexperience.ng.bluemix.net/qstage
 
Well bye guys, I'll have these thoughts haunt me in my sleep
 
8:44 PM
Is this main ready? or should I wait longer
 
@fergusq Then you're limited by the Church-Turing Thesis. Even our current quantum computing algorithms are still bounded by that model.
 
How would I be limited by the Church-Turing thesis if I assume that it does not hold?
 
But it does hold, if you want an answer.
 
How so?
 
Because that's the definition of computable.
It's not the Church-Turing Hypothesis or the Church-Turing Conjecture.
If you want to be outside of the Church-Turing Thesis, then you need to adjust your definitions of what "an answer" means.
 
Doesn't the Church-Turing thesis state that every computable function can be computed by a Turing machine? If that doesn't hold, we have that there are computable functions which can't be computed by Turing machines.
 
Did you just link to MSN? What's this? 2007?
 
@fergusq But it does hold. That's the point.
 
No, we don't know.
 
lolwut
 
8:52 PM
@DownChristopher D: you use internet explorer?
 
The Church-Turing thesis is unproven. It is possible that the physical world is hyper-TC, which would mean that there could be physical machines that could calculate computations not computable by Turing Machines.
 
@Downgoat no I use edge on the computer that has no chrome and chrome on the other one
 
@KritixiLithos on as the emitted photos travel at a finite speed
 
It seems improbable that hyper-Turing machines could exist, as it is against the current physical theories. But still, everything is possible and theories can have errors. We don't know.
 
@fergusq OK, I'll concede that it's unproven in the absolute. We have found nothing that contradicts it and every attempt has resulted in strengthening the belief that it's the be-all end-all of what's computable.
But, just like it hasn't yet been proven that P != NP, the overwhelming volume of evidence suggests that is the case.
 
8:58 PM
But what is proven, though, is that even if such hyper-Turing complete machines exist, there cannot exist a finite proof that proves that they really are hyper-TC. Such hyper-TC machine could of course evaluate an infinite proof.
 
@fergusq Yes. That indirectly gets back to my statement about what "an answer" means.
gtg
 
Anonymous
@fergusq That's impossible. An infinite number of calculations in finite time means an infinite amount of data in (presumably) finite space being moved around infinitely quickly, which violates both the Bekenstein bound and relativity.
 
@Mego Except that Bekenstein bound and relativity are both unproven.
 
Anonymous
@fergusq I don't know what flawed logic would lead you to that assumption. Relativity (both special and general) have been proven empirically to be consistent and correct by numerous experiments. The Bekenstein bound is a result of the laws of thermodynamics, which have similarly been proven correct and consistent.
 
I doubt there exist any "proven" physical theory. A theory can be falsified, but never proven. That is a very basic principle of science.
 
Anonymous
9:08 PM
In fact, general relativity can be derived from the Bekenstein bound and the laws of thermodynamics
 
Anonymous
If everything a theory predicts turns out to be correct, it's proven.
 
Anonymous
Furthermore, there is no reason to believe that relativity is incorrect, except to engage in petulant internet arguments.
 
No, that's a common fallacy. Many theories have appeared to be correct until disproven. Take any early physical theory, like Newtonian gravity. Seems legit, everything works, but then comes Einstein and others and replace it with relativity. In a similar manner it is possible that relativity will be disproven in future.
 
1
Q: Bowl a rectangular quine

Down ChristopherYou must bowl a quine following the rules of code bowling and quines. See here for the standard Code Bowling rules. Definition of a quine: A quine is some code that takes no input and returns the source code without reading said source code in any way. Quines returned must be returned ...

 
I'm not saying that relativity is incorrect, I'm just saying that it is possible that it is incorrect.
 
Anonymous
9:12 PM
Regardless of your views on relativity, you can't argue against thermodynamics. The laws of thermodynamics are physical laws, not theories (meaning they're descriptive, rather than proscriptive).
 
Nope, they are theories. They are just called laws.
They describe what we have seen, but not what we haven't seen.
 
Anonymous
Clearly any further discussion with you will be similarly fruitless, so I'm going to stop now
 
puts away popcorn aww...
 
@flawr ikr
@mınxomaτ RIP
@NewMainPosts seriously, why overrule the standard quine definitions? they exist for a reason.
 
@Riker Since I said so
 
9:20 PM
tha'ts not an answer to my question
that doesn't explain why you did that
I obviously understand that you did overrule the def but why?
 
Because I didn't like those definitions
I felt they would not work with the challange
 
I'd appreciate if you'd add a statement of the sorts to the post
also, can you clarify the bit about the source being a rectangle? you don't actually state that anywhere
@DJMcMayhem wot
 
:D
Weird right?
 
@Riker fixed
Also I felt that the restrictions on what a "real" quine is would make it too hard
 
HF is RefreshFor - the same as for but with a numeric delay in milliseconds before x.

Similarly, HW is RefreshFor - the same as while but with a numeric delay in milliseconds before x.
@ASCII-only I think this is a typo
 
9:50 PM
@djm ye
@DownChristopher hm ok
@AlbertRenshaw nice edits
 
@fergusq But relativity effectively matches Newtonian physics at speeds and scales that humans consider normal. I think it would be more accurate to say "relativity may not be fully descriptive" rather than "relativity may be incorrect".
 
People who have had or currently have retainers: how long does it feel really weird for?
 
Which kind? Permanent or non-permanent?
 
@Riker Non-permanent (I have it in right now on the top) for about 1 day
Permanent about 3-4 days
The only person I know who got a non-perm on the bottom said he wished he got a permanent
 

« first day (2238 days earlier)      last day (2616 days later) »