this post was submitted on 30 Nov 2023

2463 points (99.6% liked)

Programmer Humor

19735 readers

501 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

Keep content in english
No advertisements
Posts must be related to programming or programmer topics

founded 1 year ago

MODERATORS

Feyter@programming.dev

anzo@programming.dev

BurningTurtle@programming.dev

pylapp@programming.dev

2463

Programmer tries to explain binary search to the police (startrek.website)

submitted 1 year ago by The_Picard_Maneuver@startrek.website to c/programmer_humor@programming.dev

394 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] Anemia@lemmy.world 3 points 1 year ago

According to my napkin math it would take longer than an hour if the tape was ~3.3*10^218 sec long (or three million trillion trillion... (18 trillions) ...trillion years). Assuming you have only have two options to choose between but can pick which alternative in in 5 seconds (2^720) and you want to get down to a 1 minute intervall.

So i mean its not impossible to find a tape long enough though it seems unlikely that we would be so off in our estimates of the age of the universe.