Explore >> Select a destination
|
You are here 
|
www.sligocki.com | ||
| | | | |
blog.sigfpe.com
|
|
| | | | | [AI summary] An elementary proof is provided for how it is possible to exhaustively search an infinite space of boolean streams in finite time by exploiting the structure of computable predicates. | |
| | | | |
scottaaronson.blog
|
|
| | | | | For the past few days, I was bummed about the sooner-than-expected loss of Steven Weinberg. Even after putting up my post, I spent hours just watching old interviews with Steve on YouTube and reading his old essays for gems of insight that I'd missed. (Someday, I'll tackle Steve's celebrated quantum field theory and general relativity... | |
| | | | |
nickdrozd.github.io
|
|
| | | | | The Busy Beaver question asks: what is the longest that a Turing machine program of n states and k colors can run when started on the blank tape before halting? The function that maps from (n, k) to the longest run length is uncomputable and grows faster than any computable function. | |
| | | | |
www.sentientdevelopments.com
|
|
| | | futurism, transhumanism, bioethics, ethics, science, philosophy, artificial intelligence, personhood. | ||
