56
If AI is making the Turing test obsolete, what might be better?
(arstechnica.com)
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 15 Dec 2023
56 points (100.0% liked)
Technology
37801 readers
261 users here now
A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.
Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.
Subcommunities on Beehaw:
This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.
founded 2 years ago
MODERATORS
Any hash map you or I have ever seen is not very intelligent, possibly not at all. But the infinitely large hash map we’re talking of is different. It can handle any possible situation it encounters. That’s part of its definition.
Our hashmaps — the finite hashmaps we use to store shipping addresses and candy crush preferences — would be torn to shreds in the real world. But not this infinite hashmap that maps all possible inputs to all possible outputs. It’s a one-layer network but it’s really wide. It’s as wide as the universe of possibility, at least.
No, infinite hash map is still not intelligent, not even by the standards used in computer science. It's not a one-layer network, it's not a network at all. To talk about network nodes form layer 1 would have to connect to multiple nodes in layer 2. The signal would have to be processed somehow. Extremely big one layer neural network could be intelligent for all we know. In theory some consciousness could emerge from sufficiently complex system like that. In a hash map there's no processing though, not matter how big it is. You simply take element A and return element B mapped to it. The operation is always the same. Making this map bigger does not add complexity, knowledge or alter how it's processing inputs. Big hash map is just like a small hash map, only bigger.