None

Here is the cipher. The question :marseyconfuseddead: has been scrambled from its original form.

>oewph spws nhit ircthe en npeatsiiad rsnhetd otne otnhsentseuclh ls etwts een inemeyh,locieut s tkeiyu raclum kootn etetf hosi?

Here is the key:

>rdmhaetyu opliwns gbfkrecv xzjuql

The first :marseywinner: to give me the answer :marseyconfuseddead: to the question :marseybeanblack: will get 10k MB and a unique badge. The only hint I will give is that I started with the Caesar :marseyburnedman: cypher method. Badge :marseymajorgeneral3: should :marseynorm: be ready :marseyexcited: in the next few days or so. The next 4 will get 10k mb.

!ghosts would :marseywood: someone in badgemaxxers mind pinging them please?

None
None

hi guys, i am looking for sites to add to my webring! gimme ur urls :p thanks @X for suggsting neocities!

None
None

How Freedesktop/RedHat harass other projects into submission

https://blog.vaxry.net/articles/2024-fdo-and-redhat

Freedesktop/RedHat's CoC team is worse than you thought

https://blog.vaxry.net/articles/2024-fdo-and-redhat2

Strags respond

https://drewdevault.com/2024/04/09/2024-04-09-FDO-conduct-enforcement.html

None
35
RDrama's Official Programmer Socks Reading Group

The Official RDrama Computer Science Reading Group

My dear !codecels, hello and welcome to the first meeting of RDrama's Computer Science Reading Group! Here's the idea - we (read: I) pick a computer science textbook, then post a list of sections and exercises from that textbook each week. In the thread, feel free ask questions, post solutions, and bully people for asking stupid questions or posting stupid solutions. If you don't want to read along, I'll post the complete exercises in the OP, so you can solve them without needing to read the book.

SICP

The book I'm starting with is 'the Structure and Interpretation of Computer Programs' (abbreviated SICP). It's a software engineering textbook written by Gerald Jay Sussman and Hal Abelson from MIT. The book builds programming from the ground up: starting with a very simple dialect of Scheme and growing it into a language with lazy evaluation, object-orientation and a self-hosting compiler. It's a fun book: the exercises are hands-on and interesting, the writing is informative without being droll, and both the book itself and a corresponding lecture series (complete with a 80s synth rendition of 'Also Sprach Zarathustra') are available for free online.

Languages

The book uses (a small subset of) Scheme as its primary language, but feel free to try using a different language. The book's dialect of scheme is available through Racket, but most lisps will work with only minor changes. Other dynamically-typed, garbage-collected languages with higher-order functions will also not require much hacking: there is an edition written in JavaScript :marseywebshit:, as well as a partial adaptation to python :marseysnek:. High-level, statically typed languages might also work: Java/Kotlin/C# :marseytunaktunak: seem doable, but I don't know those languages well. Strongly typed languages like Haskell will require some real hacks, and I'd avoid doing it in C, C++ or Rust.

Exercises

The book is split into five chapters:

  • Building Abstractions with Procedures
  • Building Abstractions with Data
  • Modularity, Objects and State
  • Metalinguistic Abstraction
  • Computing with Register Machines

This week, I'll be posting exercises from the first chapter. The chapter is pretty easy for those familiar with programming already, so I just want to get it out of the way. Here are the selected exercises:

Exercise 1.8

Newton's method for cube roots is based on the fact that if y is an approximation to the cube root of x, then a better approximation is given by the value (x/y² + 2y) / 3. Use this formula to implement a cube-root procedure which is wrong by at most 0.01.

Exercise 1.12

The following pattern of numbers is called Pascal's Triangle.

    1
   1 1
  1 2 1
 1 3 3 1
1 4 6 4 1
   ...

The numbers at the edge of the triangle are all 1, and each number inside the triangle is the sum of the two numbers above it. Write a procedure that computes elements of Pascal's triangle.

Exercise 1.18

Devise a procedure generates an iterative process for multiplying two integers in terms of adding, doubling, and halving and uses a logarithmic number of steps.

Exercise 1.31

Write a procedure called product that returns the product of the values of a function at points over a given range (product(l, r,step,f) = f(l) * f(l+step) * f(l + 2 * step) * ... * f(r)). Show how to define factorial in terms of product. Also use product to compute approximations to using the formula π/4 = (2 * 4 * 4 * 6 * 6 * 8 ...) / (3 * 3 * 5 * 5 * 7 * 7 ...)

Exercise 1.43

If f is a numerical function and n is a positive integer, then we can form the nth repeated application of f, which is defined to be the function whose value at x is f(f(...(f(x))...)). For example, if f is the function x → x + 1, then the nth repeated application of f is the function x → x + n. If f is the operation of squaring a number, then the nth repeated application of f is the function that raises its argument to the 2 * nth power. Write a procedure that takes as inputs a procedure that computes f and a positive integer n and returns the procedure that computes the nth repeated application of f. Your procedure should be able to be used as follows: repeated(square,2)(5) = 625

Have fun! :marseytype:

None

Potential sites to farm drama :marseytroublemaker:

None
23
New cooder language can use your GPU to run code in parallel :marseycumplosion:

TLDR

Bend uses "interaction combinators" to parallelize your code

It's written in Rust and looks like Python

No loops. You use bend to structure data and fold to parse it recursively

You can use your GPU (or extra CPU cores) to run shiet in parallel

None

Email in question

https://i.rdrama.net/images/17159712384760141.webp

Picture of the coder

https://i.rdrama.net/images/17159712387278938.webp

I stole this thread from /g/

None

Orange Site:

https://news.ycombinator.com/item?id=40383029

:marseysnoo:

https://old.reddit.com/r/technology/comments/1cu3u18/the_90s_favorite_media_player_winamp_is_going/?sort=controversial

:marsey4chan:

https://boards.4chan.org/g/thread/100511521

https://boards.4chan.org/g/thread/100517822

:marseybluecheck:

https://twitter.com/winamp/status/1791121664689725683#m

None
None
None
None
None
10
Airpods 2nd gen and Windows 11 volume issues

This is a bit niche but nobody else on the (publicly indexed non-groomercord) internet has asked about it so might as well ask the tards here. I use a pair of 2nd gen airpods (third set I've purchased, they fit my ears better than any of the other ones) and they have some kind of super annoying artificial volume limitation on windows 11. They're about 1/2 as loud as they should be at max win11 system and max application volume vs my iphone. I can get around this with amp software gain boosters but this obviously adds lots of distortion. Has anyone else encountered this or found a solution?

None

https://old.reddit.com/r/ios/comments/1cryayx/latest_ios_update_has_brought_back_some_pictures/?sort=controversial

None

Hashcat is the world's fastest and most advanced password recovery utility, supporting five unique modes of attack for over 300 highly-optimized hashing algorithms. hashcat currently supports CPUs, GPUs, and other hardware accelerators on Linux, Windows, and macOS, and has facilities to help enable distributed password cracking.

!chuds :marseyantiwork:

None
None
20
Mood
Link copied to clipboard
Action successful!
Error, please refresh the page and try again.