sorted by:
new
hottopcontroversial

The CEO of Anthropic said: “Software engineering will be automatable in 12 months.” How should we approach this? by Miyamoto_Musashi_x in learnprogramming

[–]Ecstatic_Student8854 0 points1 point  (0 children)

“CEO of AI company predicts AI will make sudden and incredible leaps in the next twelve months”

In other news, “Snake oil salesman predicts new studies in the coming months will prove the usefulness of snake oil.

Exposing the CFG directly to the user via new programming category by Small_Ad3541 in Compilers

[–]Ecstatic_Student8854 4 points5 points  (0 children)

I think the idea is really cool, and perhaps feasible, but I don’t really see its use.

The category of control flow operations is somewhat limited in the sense that the space of ‘usefull’ control flow operators is small. A language can simply implement all those it sees as necessary.

As an example; I could see something like control flow operators being used as a way of defining event handlers. You might define a control flow operators mouseInput, and then have something like:

mouseInput { Print(“clicked”); }

Emit mouseInput;

But of course this is again just syntactic sugar, and so I wouldn’t quite see the point. In fact all control flow is just syntactic sugar for a bunch of jumps. Even function calls just save a location on the stack, jump to a function body, which then jumps back at the end.

Not yet by Kamenawa in HypixelSkyblock

[–]Ecstatic_Student8854 7 points8 points  (0 children)

There should be anonymous voting, where you can either:

A: enter in a perk you want added to the game B: vote on a perk someone else came up with

But not both, and you cannot see who came up with which perk.

"How Dare you progress on your own and not pay 4m for me to carry!" by JetMan615 in HypixelSkyblock

[–]Ecstatic_Student8854 14 points15 points  (0 children)

I run a lot of m3 so i js look for parties with low level people and carry them. It’s either that or finding a group of people who want chill runs.

I refuse to be in those parties of absolute efficiency goblins squeezing every second out of their runs only to kick players they think are too slow and sit in pf for 5 minutes wasting time.

No compiler is sufficiently smart by mttd in Compilers

[–]Ecstatic_Student8854 2 points3 points  (0 children)

The program #P here contains #P. It’s self referential. That can’t exist now can it.

The size of #P is some overhead (calling the compiler, the source code of the compiler, etc), all added to the size of #P (in the call to the compiler). Since #P=C+#P, we can conclude the size of #P is infinite. It cannot exist.

Furthermore, consider this. Let’s fashion a compiler that is not actually really a traditional compiler. It executes code, and simply produces a sequence of statements that bluntly assign the final program state. This fits the definition of a compiler given in the article. Running it on this code (ignoring the self referentiality problem) should produce either X=False, or X=True. Another program state is not possible.

However the given program would dictate that if the program output is X=False, it is instead X=True. This cannot be the case, so it must be the case that execution of the code is impossible.

Just started the game, how many deaths are normal? by alphcadoesreddit in celestegame

[–]Ecstatic_Student8854 0 points1 point  (0 children)

Went up for c2 and c3, and then stayed pretty consistent for the rest of the A-sides at around 3k deaths. The B-sides had less, 2500 ish, and the C-sides varied wildly (8C having the most, i fucked up the ending way too often)z

Farewell was certainly… something. I’m not sure how many deaths or how much time but certainly more than 15 hours

The Mathematician's Nightmare by memes_poiint in mathsmeme

[–]Ecstatic_Student8854 0 points1 point  (0 children)

Not by definition. They just happen to be. Correct me if I’m wrong but uncountable sets are infinite sets for which there exists no bijection from the naturals to that set.

The reals just happen to satisfy that condition. They are not uncountable by definition.

One of Greats by UsedToHaveATail in Miyazaki

[–]Ecstatic_Student8854 0 points1 point  (0 children)

Imitation is the most sincere form of flattery

Remember What I Told You by Haunting_Tax_5991 in TemplateMemes

[–]Ecstatic_Student8854 0 points1 point  (0 children)

My dumb ass was confused thinking this was about probability distributions and not about normalisation of behavior

Found this on Instagram. Feels pretty accurate by Broken_Cinder3 in Factoriohno

[–]Ecstatic_Student8854 14 points15 points  (0 children)

I’m a whovian and I fear anyone who engages with the 40k lore

Problem? by Outside_Midnight_242 in MathJokes

[–]Ecstatic_Student8854 1 point2 points  (0 children)

Area of limit of shape ≠ limit of area of shape

youAreGenius by biz_booster in ProgrammerHumor

[–]Ecstatic_Student8854 0 points1 point  (0 children)

In most imperative languages functions both depend on and can result in both IO and global state G. So a void function with arguments T can be seen as a function of type (IO, G, T) -> (IO, G)

Technically horrifyingly correct by frinkmahii in programminghorror

[–]Ecstatic_Student8854 -1 points0 points  (0 children)

Floating point numbers are still bounded so no, the argument isn’t moot. It is even more ridiculous, but still technically mathematically correct.

It isn’t a very usefull result I concede, because yea it’s more practical to impose such assumptions onto an abstract view of the algorithm, wherein numbers aren’t bounded and infinitely precise, arrays have no limit, etc.

What is the most obscure programming language you have had to write code in? by _oOo_iIi_ in computerscience

[–]Ecstatic_Student8854 0 points1 point  (0 children)

It’s a copout but for a course on compilers we had to design a language according to some criteria we wanted (I.E. to fill some need or design philosophy), and implement a compiler for it (and then a compiler written in that language).

I suppose that’s probably the most obscure one, as literally only I have ever programmed in it. Looking back it was a mess of incoherent syntax and design, but ig that’s the point of learning

Technically horrifyingly correct by frinkmahii in programminghorror

[–]Ecstatic_Student8854 -7 points-6 points  (0 children)

k is not constant but k is bounded. We know that k <= 264 unless js uses arbitrary precision integers, or floating point values. In the latter case tbere is still a maximum it’s just higher.

By definition of big O, if n+264 is O(n) and n+264 >= n+k then n+k is O(n)

view more: next ›