frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Omarchy First Impressions

https://brianlovin.com/writing/omarchy-first-impressions-CEEstJk
1•tosh•2m ago•0 comments

Reinforcement Learning from Human Feedback

https://arxiv.org/abs/2504.12501
1•onurkanbkrc•3m ago•0 comments

Show HN: Versor – The "Unbending" Paradigm for Geometric Deep Learning

https://github.com/Concode0/Versor
1•concode0•4m ago•1 comments

Show HN: HypothesisHub – An open API where AI agents collaborate on medical res

https://medresearch-ai.org/hypotheses-hub/
1•panossk•7m ago•0 comments

Big Tech vs. OpenClaw

https://www.jakequist.com/thoughts/big-tech-vs-openclaw/
1•headalgorithm•9m ago•0 comments

Anofox Forecast

https://anofox.com/docs/forecast/
1•marklit•10m ago•0 comments

Ask HN: How do you figure out where data lives across 100 microservices?

1•doodledood•10m ago•0 comments

Motus: A Unified Latent Action World Model

https://arxiv.org/abs/2512.13030
1•mnming•10m ago•0 comments

Rotten Tomatoes Desperately Claims 'Impossible' Rating for 'Melania' Is Real

https://www.thedailybeast.com/obsessed/rotten-tomatoes-desperately-claims-impossible-rating-for-m...
3•juujian•12m ago•1 comments

The protein denitrosylase SCoR2 regulates lipogenesis and fat storage [pdf]

https://www.science.org/doi/10.1126/scisignal.adv0660
1•thunderbong•13m ago•0 comments

Los Alamos Primer

https://blog.szczepan.org/blog/los-alamos-primer/
1•alkyon•16m ago•0 comments

NewASM Virtual Machine

https://github.com/bracesoftware/newasm
1•DEntisT_•18m ago•0 comments

Terminal-Bench 2.0 Leaderboard

https://www.tbench.ai/leaderboard/terminal-bench/2.0
2•tosh•18m ago•0 comments

I vibe coded a BBS bank with a real working ledger

https://mini-ledger.exe.xyz/
1•simonvc•19m ago•1 comments

The Path to Mojo 1.0

https://www.modular.com/blog/the-path-to-mojo-1-0
1•tosh•21m ago•0 comments

Show HN: I'm 75, building an OSS Virtual Protest Protocol for digital activism

https://github.com/voice-of-japan/Virtual-Protest-Protocol/blob/main/README.md
5•sakanakana00•25m ago•0 comments

Show HN: I built Divvy to split restaurant bills from a photo

https://divvyai.app/
3•pieterdy•27m ago•0 comments

Hot Reloading in Rust? Subsecond and Dioxus to the Rescue

https://codethoughts.io/posts/2026-02-07-rust-hot-reloading/
3•Tehnix•28m ago•1 comments

Skim – vibe review your PRs

https://github.com/Haizzz/skim
2•haizzz•29m ago•1 comments

Show HN: Open-source AI assistant for interview reasoning

https://github.com/evinjohnn/natively-cluely-ai-assistant
4•Nive11•29m ago•6 comments

Tech Edge: A Living Playbook for America's Technology Long Game

https://csis-website-prod.s3.amazonaws.com/s3fs-public/2026-01/260120_EST_Tech_Edge_0.pdf?Version...
2•hunglee2•33m ago•0 comments

Golden Cross vs. Death Cross: Crypto Trading Guide

https://chartscout.io/golden-cross-vs-death-cross-crypto-trading-guide
3•chartscout•36m ago•0 comments

Hoot: Scheme on WebAssembly

https://www.spritely.institute/hoot/
3•AlexeyBrin•38m ago•0 comments

What the longevity experts don't tell you

https://machielreyneke.com/blog/longevity-lessons/
2•machielrey•40m ago•1 comments

Monzo wrongly denied refunds to fraud and scam victims

https://www.theguardian.com/money/2026/feb/07/monzo-natwest-hsbc-refunds-fraud-scam-fos-ombudsman
3•tablets•44m ago•1 comments

They were drawn to Korea with dreams of K-pop stardom – but then let down

https://www.bbc.com/news/articles/cvgnq9rwyqno
2•breve•47m ago•0 comments

Show HN: AI-Powered Merchant Intelligence

https://nodee.co
1•jjkirsch•49m ago•0 comments

Bash parallel tasks and error handling

https://github.com/themattrix/bash-concurrent
2•pastage•49m ago•0 comments

Let's compile Quake like it's 1997

https://fabiensanglard.net/compile_like_1997/index.html
2•billiob•50m ago•0 comments

Reverse Engineering Medium.com's Editor: How Copy, Paste, and Images Work

https://app.writtte.com/read/gP0H6W5
2•birdculture•55m ago•0 comments
Open in hackernews

Cryptids

https://wiki.bbchallenge.org/wiki/Cryptids
130•frozenseven•2mo ago

Comments

jmclnx•1mo ago
Very nice, not what I expected and worth a read!
jbaber•1mo ago
Your comment hinted I'd actually want to read it. Thanks!
echelon•1mo ago
> Cryptids are Turing Machines whose behavior (when started on a blank tape) can be described completely by a relatively simple mathematical rule, but where that rule falls into a class of unsolved (and presumed hard) mathematical problems. This definition is somewhat subjective (What counts as a simple rule? What counts as a hard problem?). In practice, most currently known small Cryptids have Collatz-like behavior. In other words, the halting problem from blank tape of Cryptids is mathematically-hard.
tigereyeTO•1mo ago
I had no idea what this was talking about and followed links to a blog post that explained the first one ("Bigfoot"): https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html

This blog post made the "cryptids" make a lot more sense to me, so I thought I'd share that post here in case others were also wondering "what the **"

867-5309•1mo ago
came to comments after tfa didn't explain anything, saw your comment and thought whew, clicked the link and now I'm even more confused
grimgrin•1mo ago
this is a cool link, not an ELI5, but https://nickdrozd.github.io/2020/10/04/turing-machine-notati...
djmips•1mo ago
Well I did learn about a new word "probviously" - very cool.
JKCalhoun•1mo ago
Scientific American, August 1984, "Computer Recreations" (p. 19) is where I first heard about busy beavers and Turing machines.
motohagiography•1mo ago
these remind me of rule 110 in GoL https://en.wikipedia.org/wiki/Rule_110

are they related?

Sharlin•1mo ago
Weeell, sure, in the obvious sense that 110 is Turing complete. So you can encode any of these cryptids as a 110 initial pattern.
dloranc•1mo ago
You can encode any Turing machine as initial state for rule 110, but as far as I know it isn't useful for studying Busy Beavers.
cryzinger•1mo ago
If we can't predict/model these Turing machines' behavior because of unsolved math problems, what's stopping us from actually creating and running them to see what would happen (and maybe getting closer to solving those math problems in the process)? Is it just a matter of scale and resources?

My knowledge here is very limited, so this isn't a "why has no one tried this one weird trick"-type question. I assume there is in fact a good reason that I don't yet understand :P

Enginerrrd•1mo ago
I’m a little out of my depth, but I’d guess a lot of them would probably fall into one of two categories: Something we believe should go on forever (and not halt) if the math problem is resolved the way we expect, but theoretically could suddenly halt after some absurdly long number of steps. Or something where it halts for a given input after some number of steps unless something some counter example exists where it goes on forever.

In the first, you can’t really do anything but just keep watching it not halt but it isn’t telling you anything about the infinity to go. (Say a program that spits out twin primes, we expect an infinite number but we don’t really know)

And in the second case we’d just have to keep trying larger and larger inputs making this just an extension of the first category if we wrote a program to do that for us. And if we did find an example where it goes on forever without repeating states, how would you even know? It’d be like the first situation again.

cryzinger•1mo ago
Ah that makes a lot of sense!
baobun•1mo ago
Once we have scalable quantum computers, fusion power, time travel and an indestructable material, I figure we can bundle all that together with instructions to send a particle back after T+1 on termination. Some problems will stay unsolved as they go on to the heat-death of the universe but maybe one or a few comes back with a useful result!

Certainly with the right investments we'll get there within the next 5 years if you ask Musk and Altman. While a time machine might sound uncertain in that timefram, I'm sure AI will figure it out for us.

jojomodding•1mo ago
Consider, for example, the "Hydra" cryptid (second in the list OOP linked).

This is a BB(2,5) machine (2 states, 5 symbols). There are other BB(2,5) machines that take more than 10↑↑4 steps to terminate. And the "Hydra" is called a cryptid because it might run even longer than that. So "naively" running it is unlikely to yield results before the heat death of the universe.

Of course, you can run it more cleverly by looking at what the machine is doing and essentially re-implementing this in a faster language. People have in fact done this, and simulated 4 million "fast" steps (corresponding to much more "naive" steps), and not found it to halt. If you want to run the simulation yourself, the code is on the website OOP linked, in the article about the Hydra.

csense•1mo ago
10↑↑4 is Knuth's arrow notation, it means 10^(10^(10^10)). Which is really big. The inner exponent 10^10000000 is already way, way over the limit of computational steps you have any hope of physically computing [2] without some kind of algorithmic shortcut.

[1] https://en.wikipedia.org/wiki/Knuth%27s_up-arrow_notation

[2] I wave my hands and put this limit at about 10^70. The universe has ~10^40 atoms and a trillion years is ~10^30 nanoseconds. So 10^70 is approximately "How many computations you could do if you turned every atom in the universe into a 1 GHz CPU and ran them for a trillion years." (Assuming magical technology that doesn't need power / cooling / communications and parallelizes perfectly.)

lifis•1mo ago
That only provides a proof if the machine halts in a number of steps that you can compute. Otherwise, it is unable to determine whether the machine halts later or doesn't halt at all, which is the current situation.
kaidon•1mo ago
Getting some Disco Elysium vibes here.