Two Searches That Would Break Computability
Imagine running two procedures side by side. Search A lists integer tuples and checks whether f equals 0.
#computability #hilbertstenth #undecidability #numbertheory
Two Searches That Would Break Computability Imagine running two procedures side by side. Search A lists integer tuples and checks whether f equals 0. #computability #hilbertstenth #undecidability #numbertheory
0 vue
Publié le 07/11/2026 18:02
1:12
Two Searches That Would Break Computability
Imagine running two procedures side by side. Search A lists integer tuples and checks whether f equals 0.
#computability #hilbertstenth #undecidability #numbertheory
0 commentaire
?