Fish n' Bits - The Aquaculture Data Intelligence Podcast
Sep 7, 2026 · 39 min · 11 segments
What does it take to turn a microscope slide into data that AI can actually use? We're joined by the CEO of Histo Company, Lene Sveen, to…
Lene SveenGuestTony ChenHostOne of the first things you learn when studying computer science is how to sort a list.
Imagine I hand you a shuffled deck of numbered cards and ask you to put them in order.
You could start with one card, take the next card and put it in the right position, and take the third card and insert that in the right position.
Or you could break the deck into smaller groups, sort those groups separately, and then efficiently combine them back together.
There are bubble sorts, quick sorts, heap sorts, an entire family of algorithms built around what sounds like an incredibly simple problem.
The reason computer science students learn this isn't because the world needs more people who know how to sort playing cards.
There can be many ways to solve exactly the same problem, but those approaches don't necessarily perform the same way.
That lesson feels relevant again today because we're entering a world where computing power can hide a lot of bad habits.
It can search through information, rewrite things, generate code, transform files, and keep trying different approaches until something works.
Give a model messy data, inconsistent terminology, unclear instructions, and you're asking it to spend computational effort figuring out what you meant before you can even start solving the actual problem.
give it clean data, consistent structure, and clear definitions, and suddenly, that same problem becomes much easier.
We've spent the last few years talking about bigger models, more compute, larger context windows, agents, reasoning models, and a ton of what these systems will be eventually able to do.
One of the first things you learn when studying computer science is how to sort a list.
Imagine I hand you a shuffled deck of numbered cards and ask you to put them in order.
You could start with one card, take the next card and put it in the right position, and take the third card and insert that in the right position.
Or you could break the deck into smaller groups, sort those groups separately, and then efficiently combine them back together.
There are bubble sorts, quick sorts, heap sorts, an entire family of algorithms built around what sounds like an incredibly simple problem.
The reason computer science students learn this isn't because the world needs more people who know how to sort playing cards.
There can be many ways to solve exactly the same problem, but those approaches don't necessarily perform the same way.
That lesson feels relevant again today because we're entering a world where computing power can hide a lot of bad habits.
It can search through information, rewrite things, generate code, transform files, and keep trying different approaches until something works.
Give a model messy data, inconsistent terminology, unclear instructions, and you're asking it to spend computational effort figuring out what you meant before you can even start solving the actual problem.
give it clean data, consistent structure, and clear definitions, and suddenly, that same problem becomes much easier.
We've spent the last few years talking about bigger models, more compute, larger context windows, agents, reasoning models, and a ton of what these systems will be eventually able to do.
The rest of this transcript — segmented and speaker-labeled, so you land on the exact moment something was said
Search every transcript — by keyword, by phrase, or by meaning, across every show Radar indexes
Trends — what is surging across podcasts, measured against its own baseline
Alerts — when a name you follow appears in a newly indexed episode
No account is needed to search Radar.