RSSAmplifier

Blog

Nicoleta Ciaușu

Hi there ~ 🔮 I like computers and art. So I'm trying to do both! Combine them, even! ✨ This is my corner of the indie w...

blog.nicoleta.ccRSS feed ↗5 posts

Latest posts

Sycophantic by design

If the models of our age are trained on the internet I know and remember, then I cannot imagine the effort it took to get them to be as sycophantic as they are. Because the way they are behaving now is nowhere near the tone of their source material. I want my LLM to correct me more the more hotter takes I give it. if you remember this xkcd: I want it to call my lazy request for information stupid,…

Maybe we just shouldn't build software with so many people

Was thinking of how a lot of the software I use and love lately has been built in very small teams, self funded, with genuine care for the product built. I think there's enough people that understand that making tech costs money, and prefer paying a small sum, to a very transparent and thoughtful business that cares for its users. Some examples of software: Notesnook, Kagi, Todoist, Ghost,…

Making a programmable LED skirt prototype 🎀

A lot of things have been on my mind lately, but the main one is that I want to do more creative tech. Considering even starting a master's in that direction (but not sure yet). What particularly interests me is creativity & interaction. So something like a new media, interactive technologies, or human-computer interaction program. If you're in any of these fields, please reach out at my e-mail 💌…

Recent little learnings for adulthood

Nobody really knows how the world works; it's everyone's first time living too. It's ok to spend your life experimenting and trying to find things out, who you are and what you like. The purpose is to enjoy your time on earth & feel well. There is no rush to anywhere. When you need to, take breaks. Efficiency is an illusion. If the goal is to enjoy life, the most efficient thing you can do is…

Turning P and NP on its head // overwhelm machines

The classic P versus NP problem in computer science asks: Can every problem that is quickly verifiable (NP) can also be quickly solved (P)? The classic example being something like Sudoku: it's easy to check if a grid is correct, but it's difficult to complete it. Or for a certain program's behavior, it's (usually) harder to code it than to check if the output is correct. With the new tools around…