Investigates the use of existing LMs (e.g, Flan-U-PaLM 540B) combined with associative read-write memory to simulate the execution of a universal Turing machine. 7 of 11
Large Language Models Simulate Universal Turing Machine with Memory
By
–
Global AI News Aggregator
By
–
Investigates the use of existing LMs (e.g, Flan-U-PaLM 540B) combined with associative read-write memory to simulate the execution of a universal Turing machine. 7 of 11
Leave a Reply