[-] kogasa@programming.dev 16 points 7 months ago

If current LLMs are conscious then consciousness is a worthless and pathetic concept.

[-] kogasa@programming.dev 15 points 1 year ago

The standard .NET C# compiler and CLI run on and build for Windows, MacOS, and Linux. You can run your ASP.NET webapps in a Linux docker container, or write console apps and run them on Linux, it doesn't matter anymore. As a .NET dev I have literally no reason to ever touch Windows, unless I'm touching legacy code from before .NET Core or building a Windows-exclusive app using a Windows app framework.

[-] kogasa@programming.dev 15 points 2 years ago* (last edited 2 years ago)

Let f(x) = 1/((x-1)^(2)). Given an integer n, compute the nth derivative of f as f^((n))(x) = (-1)^(n)(n+1)!/((x-1)^(n+2)), which lets us write f as the Taylor series about x=0 whose nth coefficient is f^((n))(0)/n! = (-1)^(-2)(n+1)!/n! = n+1. We now compute the nth coefficient with a simple recursion. To show this process works, we make an inductive argument: the 0th coefficient is f(0) = 1, and the nth coefficient is (f(x) - (1 + 2x + 3x^(2) + ... + nx^(n-1)))/x^(n) evaluated at x=0. Note that each coefficient appearing in the previous expression is an integer between 0 and n, so by inductive hypothesis we can represent it by incrementing 0 repeatedly. Unfortunately, the expression we've written isn't well-defined at x=0 since we can't divide by 0, but as we'd expect, the limit as x->0 is defined and equal to n+1 (exercise: prove this). To compute the limit, we can evaluate at a sufficiently small value of x and argue by monotonicity or squeezing that n+1 is the nearest integer. (exercise: determine an upper bound for |x| that makes this argument work and fill in the details). Finally, evaluate our expression at the appropriate value of x for each k from 1 to n, using each result to compute the next, until we are able to write each coefficient. Evaluate one more time and conclude by rounding to the value of n+1. This increments n.

[-] kogasa@programming.dev 15 points 2 years ago

Once every 50 years or so

[-] kogasa@programming.dev 15 points 2 years ago

Which is wrong, because you incorrectly assumed there was one correct answer

[-] kogasa@programming.dev 15 points 2 years ago

3 billion devices

[-] kogasa@programming.dev 16 points 2 years ago

It's common to just use "log" in pure math, since nobody uses the base 10 log.

[-] kogasa@programming.dev 15 points 2 years ago

Yeah but survival is the worst part about minecraft.

[-] kogasa@programming.dev 16 points 2 years ago

I bet a bot can beat you at Counter Strike too if we made them as strong as possible like chess bots.

[-] kogasa@programming.dev 15 points 2 years ago

The top half is his human disguise.

[-] kogasa@programming.dev 15 points 2 years ago

If you've ever had a large coffee, it's like that. If you've ever had 3 large coffees and a heart condition, the same principle applies.

[-] kogasa@programming.dev 15 points 2 years ago

Sure, and VSCode without any plugins is a text editor, not an IDE.

view more: ‹ prev next ›

kogasa

0 post score
0 comment score
joined 3 years ago