1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Anthony Di Franco
To date, work on formalizing connectionist computation in a way that is at least Turing-complete has focused on recurrent architectures and developed equivalences to Turing machine…