News for hackers. Stuff that matters.

A comment on Grandmaster-Level Chess Without Search. Parent comment

Re:Grandmaster-Level Chess Without Search by jackblemming on Thursday February 08, 2024 @04:45PM (#39308154)
No, arbitrarily wide neural networks are approximators of Borel Measurable functions. Big difference between that and “any function”. RNNs are Turing Complete though.
[ Parent | on HN ]
Re:Grandmaster-Level Chess Without Search by eldenring on Thursday February 08, 2024 @04:56PM (#39308296)
You can say the same thing about RNNs. Technically nothing is turing complete without infinite scratch space.
[ Parent | on HN ]