Lovely article by Pèrez and colleagues. Yes, the naive expectation might be that “complex enough” becomes Turing complete, but as discussed in the lucid introdu

Lovely article by Pèrez and colleagues. Yes, the naive expectation might be that “complex enough” becomes Turing complete, but as discussed in the lucid introduction this is often thought to require a recurrent process. So it is good to see the formal proof. https://scholar.google.com/citations?hl=en&user=a6lUuiwAAAAJ&view_op=list_works&sortby=pubdate https://scholar.google.com/citations?hl=en&user=a6lUuiwAAAAJ...