Comment in Reply to "On the complexity of extending the convergence region for Traub’s method"
preprint
OA: closed
Abstract
This comment is in reply to the paper “On the complexity of extending the convergence region for Traub’s method” [1]. In complexity science, from the mathematical perspective, discussions of complexity often concern algorithmic complexity such as in the paper responded to here [2]. But this is only one of the kinds of complexity that exists even in the mathematical domain. There is also the complexity in the behavior of a system of equations; there is the complexity of the reasoning or algorithm required to understand a system of equations (“understand” interpreted here as defining the problem needing to be solved); and, as mentioned, there is the complexity of the reasoning or algorithm required to solve a system of equations.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00