twtxt

Timeline for https://texto-plano.xyz/~thiegui/twtxt.txt

🔄 Refresh timeline

👨‍💻 Login

Following: 8

twtr_news https://duriny.envs.sh/twtr/news.txt Remove

dev1ls https://texto-plano.xyz/~dev1ls/twtxt.txt Remove

dfaria https://dfaria.eu/twtxt.txt Remove

hamefang https://hamefang.neocities.org/twtxt/music.txt Remove

hundred-rabbits https://feeds.twtxt.net/hundred-rabbits/twtxt.txt Remove

movq https://www.uninformativ.de/twtxt.txt Remove

thiegui https://texto-plano.xyz/~thiegui/twtxt.txt Remove

twtxt https://buckket.org/twtxt_news.txt Remove


movq
Reply to #y7edboa
@xuu Yes, exactly that. *But*: I do have more than 32 bits after all, when I use `double` or `long double`. 😲 I went with `long double` which has 80 bits even on DOS (63 bits mantissa, I think).

(I only wrote a brute-force thingy this morning, so I didn’t even think about doing anything related to polynomials or `double`. 😅 Even part 2 only took 55 ms. But for DOS, this wasn’t an option anyway, so I did the proper math while waiting for something at work. 🤣)



It’s still a bit surprising to me. Usually, AoC doesn’t require such tricks and most things fit neatly into 32 bits. Maybe there’s a better solution after all. 🤔 I might have a look at reddit.
2 hours ago
💬 Reply


movq
Today’s AoC puzzle is a very simple problem on modern machines, but quite tricky for me: It involves a number that doesn’t fit into 32 bits. 🤔 I wonder if/how I can manage to port this beast to DOS. (I once wrote a “big int” library myself, but that was *ages* ago and I hardly remember it anymore.)
11 hours ago
💬 Reply


movq
Reply to #zktowyq
@xuu I see, interesting. 🤔 Now I’m curious if I could optimize my brute-force solution as well. 😅 (I wrote a “proper” solution in the meantime after watching a visualization by someone else.)
11 hours ago
💬 Reply


movq
Reply to #ebrldga
@lyse What a great scenery. 😊 I hope the snow comes back soon. It’s all gone at the moment and well above 0°C.
12 hours ago
💬 Reply


movq
Reply to #zktowyq
@xuu And that is still a brute-force attempt? That’d be *really* fast. 😳 Are you doing anything clever or is your CPU just that powerful? 😅
12 hours ago
💬 Reply


dfaria
New at #SEP: Psychoanalytic Feminism https://plato.stanford.edu/entries/feminism-psychoanalysis/
16 hours ago
💬 Reply


dfaria
New at #SEP: Jean-Baptiste Du Bos https://plato.stanford.edu/entries/du-bos/
22 hours ago
💬 Reply


movq
Reply to #irslaoq
@prologic Doing AoC competitively is super hard. I don’t enjoy this at all. I just *happened* to be quick these first few days. 😅

I rather set my own goals. Like the DOS thing this year. That is a lot of fun. 😊 (I just have to remember not to check the leaderboards. 🤣)
1 day ago
💬 Reply


dfaria
New at #SocialEpistemology: What Exactly is Wrong with Telling Someone You Believe Them When You Don’t? A Reply to Luxemburg-Peck, David C. Spewak Jr., https://social-epistemology.com/2023/12/05/what-exactly-is-wrong-with-telling-someone-you-believe-them-when-you-dont-a-reply-to-luxemburg-peck-david-c-spewak-jr/
1 day ago
💬 Reply


dfaria
New at #APA: Deloria’s God is Red and Liberationist Philosophies of Black Religion https://blog.apaonline.org/2023/12/05/delorias-god-is-red-and-liberationist-philosophies-of-black-religion/
1 day ago
💬 Reply


dfaria
FLUP - Conferência "Deteção e gestão de plágio na era da IA: (mais) desafios éticos": https://sigarra.up.pt/flup/pt/noticias_geral.ver_noticia?p_nr=167487
1 day ago
💬 Reply


dfaria
Novo evento na #FLUP: Sessão 6 | Seminários de Investigação MLAG 2023/2024 https://sigarra.up.pt/flup/noticias_geral.ver_noticia?p_nr=168446
1 day ago
💬 Reply


movq
Reply to #irslaoq
… it just finished and brute-force worked. 18 minutes of computing time on my 11 year old machine, single-threaded.
1 day ago
💬 Reply


movq
Reply to #irslaoq
@xuu I ask myself that question every year. 🤣

To be fair, the first part wasn’t really that difficult. If you have *A LOT* of experience with these kind of problems/puzzles and if you have a proper framework, I imagine it’s doable. (I, on the other hand, spent about 40 minutes just writing my C code to parse the input.)

Some of these people record themselves and then post it on YouTube. It’s pretty crazy to watch. 🥴

The second part of the puzzle, was/is pretty hard, though. At least for me, because I haven’t found “the trick” yet. I’m currently trying to brute-force it while having breakfast. 😅 (But given that it took ~8 minutes for the first person to get both stars, maybe they brute-forced it as well. With a faster machine and multithreading, ~8 minutes sounds about right. Brute-force is rarely the answer in AoC, though.)
1 day ago
💬 Reply


movq
Reply to #txfbuaq
@eapl.me It’s been a while since I used QBasic/QuickBasic, but yep, I remember the experience being quite similar. 😊
1 day ago
💬 Reply


movq
Reply to #ghidsjq
@jason I got it. I was already asleep yesterday. 😅
1 day ago
💬 Reply


dfaria
On the Social Utility of Religion | Epoché Magazine: https://epochemagazine.org/67/on-the-social-utility-of-religion/
1 day ago
💬 Reply


dfaria
New at #1000WordPhilosophy: Form and Matter: Hylomorphism https://1000wordphilosophy.com/2023/12/04/hylomorphism/
1 day ago
💬 Reply


movq
Reply to #ghidsjq
@jason Sure thing. The address is on my website. 👌
1 day ago
💬 Reply


dfaria
New at #APA: Against Slickness https://blog.apaonline.org/2023/12/04/against-slickness/
1 day ago
💬 Reply


dfaria
New at #SEP: Supervenience https://plato.stanford.edu/entries/supervenience/
1 day ago
💬 Reply


dfaria
New at #SEP: Reasoning About Power in Games https://plato.stanford.edu/entries/logic-power-games/
1 day ago
💬 Reply


movq
It is a pleasure to work with the help system of Borland’s Turbo C++ 3.0 on DOS. The descriptions are clear and concise. There are short and simple examples. Pretty much every help page is cross-refenced and those links can be *clicked*.
2 days ago
💬 Reply


movq
Reply to #s7b6peq
@lyse

> Holidays up until next year, hm?

Exactly that. 🛌
2 days ago
💬 Reply


dfaria
8th GRADUATE CONFERENCE | Aesthetics, Politics and Knowledge Research Seminar 2023 | Programme: https://ifilosofia.up.pt/files/Activities/APK/Brochura_8GC_APA_2023.pdf
2 days ago
💬 Reply


dfaria
FLUP - Colóquio | Espaço Público e Democracia Deliberativa num Contexto de Aceleração: https://sigarra.up.pt/flup/pt/noticias_geral.ver_noticia?P_NR=168266
2 days ago
💬 Reply


movq
Reply to #zkjovca
@prologic Here you go: https://movq.de/v/dfb04df5c7/aoc2023-day4-part2.txt
2 days ago
💬 Reply


movq
Reply to #s7b6peq
That second photo is from our local pond. See all those tracks in the snow? Those are from the ducks and the other birds that stayed here.

This video is from a couple of days ago – just frozen, no snow yet:

https://movq.de/v/527a76bd19/VID_20231203_104847.mp4.mp4
2 days ago
💬 Reply


movq
Reply to #ghidsjq
@jason If you can describe the problem, maybe I can help.
2 days ago
💬 Reply


movq
Reply to #zkjovca
@prologic I can try to explain, if you want to know. 😅 Or maybe this guy’s visualization will help (if you can see it, not sure): https://old.reddit.com/r/adventofcode/comments/18af47j/2023_day_4_scratchcard_counting/
2 days ago
💬 Reply


movq
A couple centimeters of snow today. 😊 And I’ve got a loooooooong vacation coming up. Time to relax. 😃





This is my favorite time of the year – by far. Even if it means the snow will freeze in my beard. 😂
2 days ago
💬 Reply


movq
Reply to #zkjovca
@prologic (Mild spoilers ahead.)

Today’s puzzle was one of those where I immediately knew that there *must* be a solution that does not require actually copying anything. AoC often has these kinds of problems that make it *look like* you have to create lots of duplicates, multiply objects, stuff like that. That’s often a sign that you can solve it by doing something simple. 😅 (If only that was true in real life as well. 😂)
2 days ago
💬 Reply


dfaria
New at #APA: On Self-Deception and Self-Imposed Suffering https://blog.apaonline.org/2023/12/04/on-self-deception-and-self-imposed-suffering/
2 days ago
💬 Reply


dfaria
New at #NWP: Lukas Naegeli (University of Bern), “Two Ways of Limiting Moral Demands” https://newworkinphilosophy.substack.com/p/lukas-naegeli-university-of-bern
2 days ago
💬 Reply


movq
Reply to #qwm7hha
A little “visualization” / “progress bar” of day 3 part 2:

https://movq.de/v/6fc13f8ce1/MVI_6766.MOV.mp4

Running in a DOS box under OS/2 Warp 4, including some of OS/2’s silly sound effects. 🤣
3 days ago
💬 Reply


dfaria
Nothing Personal - How ideas made Derek Parfit: https://hedgehogreview.com/issues/markets-and-the-good/articles/nothing-personal
3 days ago
💬 Reply


dfaria
Linguistic Justice Society: https://hiw.kuleuven.be/ripple/research/linguisticjusticesociety
3 days ago
💬 Reply


movq
Reply to #apnoyca
@prologic Yours is more clever and cleaner, I think. 🤔 You were able to reuse more code for the second part. I, instead, wrote a different search logic for part 2. 😅
3 days ago
💬 Reply


movq
Reply to #apnoyca
@prologic

> Did I write too much code again? 😅

I don’t know. 😅 My solution is rather long as well:

https://www.uninformativ.de/git/advent-of-code/file/2023/day03/s.c.html

Still happily runs on DOS.
3 days ago
💬 Reply


movq
Reply to #qwm7hha
@prologic Oof, it’s already getting a bit tricky. 😬
3 days ago
💬 Reply


movq
Reply to #vdtfw2a
@lyse All I can say is: My client didn’t report any errors. :-) (Does that mean anything? 😅)
3 days ago
💬 Reply


movq
Reply to #6oq4ywq
@xuu Ah, you went with the “scanning” approach as well. I did that, too.

It’s quite surprising to see (imho) how many people on reddit started substituting strings (`one` becomes `1` etc.). That makes the puzzle *much* harder by introducing nasty corner cases.

(Maybe I was just lucky this time to pick the correct approach right from the start. 🤣 Or maybe it’s a bit of experience from doing past AoC events …)
3 days ago
💬 Reply


dfaria
Evelyn Fox Keller (1936–2023), philosopher who questioned gender roles in science: https://www.nature.com/articles/d41586-023-03819-4
3 days ago
💬 Reply


dfaria
New at #SEP: Logicism and Neologicism https://plato.stanford.edu/entries/logicism/
3 days ago
💬 Reply


dfaria
Key Philosophical Texts - Five Books Expert Recommendations: https://fivebooks.com/best-books/key-philosophical-texts-western-nigel-warburton/
4 days ago
💬 Reply


movq
Here’s some more #AdventOfCode nostalgia:

https://movq.de/v/6441f2fe2a/MVI_6760.MOV.mp4

It shows the machine’s boot sequence and the copy process: I somehow have to grab the files from my normal PC and I do that using FTP under Windows 3.11, there’s a PCI Ethernet card in that machine. Then some glorious WinZip action to decompress the files. 😃 Finally the first two AoC 2023 puzzles are being run.

(Yes, there’s a GRUB on that machine. 🥴 It’s a left-over from some experiments with Linux ages ago and I didn’t bother to uninstall it.)
4 days ago
💬 Reply


movq
Reply to #wg7xx5q
@prologic That is a lot of code, yes. 😅 Mine is shorter, has more naive searching (it searches a word like `red` and then backtracks to the number before it; completely ignoring the semi-colons because they don’t matter), and – like any good C program – will crash horribly on malformed input. 👌😂🥴

https://www.uninformativ.de/git/advent-of-code/file/2023/day02/s.c.html

It really depends on what you’re after. I’d never write code like this in “real-world applications”. But for these puzzles and my DOS use case, it’s “good enough”. 😅
4 days ago
💬 Reply


movq
Reply to #mxyoxrq
My immediate reaction to today’s puzzle was: “Ahhh, shit.” 😂 Parsing these input files in C is not a lot of fun. 🥴
4 days ago
💬 Reply


movq
Reply to #kr3qhra
@prologic It sure does! 😊 (Was the video big/large enough? I should probably capture in a higher resolution next time. 🤔)
4 days ago
💬 Reply


movq
Reply to #kr3qhra
@prologic The solutions will go here:

git clone https://uninformativ.de/git/advent-of-code.git

About demos … I made a video yesterday, but I’m not sure if it’s that interesting. 😅

https://movq.de/v/de32f1481f/MVI_6756.MOV.mp4

I’d probably have to do some cool visualizations for the more interesting puzzles. 🤔 Not sure if I can pull that off, though. 😅 It’s probably going to be hard enough anyway. (I wonder how long I can get away with just conventional memory, i.e. only ~500 kB.) We’ll see.
4 days ago
💬 Reply


⏭️ Next