>>12304770The BSS model is way too powerful. You can compute polynomials of exponential degree in polytime because arbitrary multiplication takes unit time.
The weak BSS model that assigns higher costs to repeated operations is more reasonable, especially since (as far as I remember), the BSS machine restricted to the {0, 1} elements of ring R can solve exactly the same problems in P as a classic TM can do P/poly. So the weak BSS is a substantial increase in power that doesn’t risk being too powerful to the point of impracticality.
Computation over arbitrary rings and computable analysis are really fucking cool subjects I wish got more attention, but the US has a lot of selective attention when it comes to Martin-Löf’s work.
