Google’s quantum supremacy claim is certainly fascinating and controversial, but even if true, it ultimately only amounts to an incremental and even inconsequential improvement in the state of AI and ML, due to the still-unmet need for a halting oracle.
I am publishing, in three parts and with his permission, an exchange with Querius, who is looking for answers as to whether computers can someday think like people. In the first part, we discussed why human thinking cannot be indefinitely compressed. Here is the second part: Recapping for myself what I said in Part I and mulling it over: “If all symbol strings do have a shorter representation, then so must their shorter representations. Thus, we’d end up concluding that all symbol strings can be represented by nothing, which is incoherent.” Wait, I’m getting lost. “Therefore, we conclude that only some symbol strings have a compressed representation. As a consequence, compression intelligence is only true if the physical effects of Read More ›
Recently, researchers discovered that fruit flies use a filter similar to a computer algorithm to assess the odors that help them find fruit, only the flies’ tools are more sophisticated: When a fly smells an odor, the fly needs to quickly figure out if it has smelled the odor before, to determine if the odor is new and something it should pay attention to,” says Saket Navlakha, an assistant professor in Salk’s Integrative Biology Laboratory. “In computer science, this is an important task called novelty detection. Computers use a Bloom filter for that, Navlakha, an integrative biologist, explains: When a search engine such as Google crawls the Web, it needs to know whether a website it comes across has previously Read More ›
A common objection to Bartlett’s idea is that humans cannot be halting oracles because we embed any unsolvable math problem as the halting condition for a loop and a human cannot tell us whether the loop will halt or not. This objection misses the fact that there is a range of oracles between plain Turing machines and a complete halting oracle. Read More ›