Skip to main content
MathOverflow

Return to Question

added 2 characters in body
Source Link
XL _At_Here_There
XL _At_Here_There
  • 3.1k
  • 17
  • 31

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational complexity over reals, for example, the one in the book by Blum,Cucker,Shub, and Smale, or the one in Weihrauch's book Computable Analysis. mathematicians on such topics usually give the definition from their own view, and as far as I know, they usually do not compare their model with others. But we know, if they give a suitable model, eventually those variant model will be proven to be equivalent, as what had happened to the classic models.

So, first, letlet's give a list of computation model and computational complexity over reals.

Second, are they equivalents? Any proof for their equivalence?

Obviously, the suitable models have to include the classic computation models as special case, and possibly,the computational complexity have to be consistent with the classic ones. As a special case, computable numbers ,especially computable irrational algebraic and transcendental ones have to have uniform or consistent definition over classic model and the computational complexity.

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational complexity over reals, for example, the one in the book by Blum,Cucker,Shub, and Smale, or the one in Weihrauch's book Computable Analysis. mathematicians on such topics usually give the definition from their own view, and as far as I know, they usually do not compare their model with others. But we know, if they give a suitable model, eventually those variant model will be proven to be equivalent, as what had happened to the classic models.

So, first, let give a list of computation model and computational complexity over reals.

Second, are they equivalents? Any proof for their equivalence?

Obviously, the suitable models have to include the classic computation models as special case, and possibly,the computational complexity have to be consistent with the classic ones. As a special case, computable numbers ,especially computable irrational algebraic and transcendental ones have to have uniform or consistent definition over classic model and the computational complexity.

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational complexity over reals, for example, the one in the book by Blum,Cucker,Shub, and Smale, or the one in Weihrauch's book Computable Analysis. mathematicians on such topics usually give the definition from their own view, and as far as I know, they usually do not compare their model with others. But we know, if they give a suitable model, eventually those variant model will be proven to be equivalent, as what had happened to the classic models.

So, first, let's give a list of computation model and computational complexity over reals.

Second, are they equivalents? Any proof for their equivalence?

Obviously, the suitable models have to include the classic computation models as special case, and possibly,the computational complexity have to be consistent with the classic ones. As a special case, computable numbers ,especially computable irrational algebraic and transcendental ones have to have uniform or consistent definition over classic model and the computational complexity.

Source Link
XL _At_Here_There
XL _At_Here_There
  • 3.1k
  • 17
  • 31

The link and equivalence between variant definition of computation model and computational complexity over reals

To unify the numerical computation and classic computability theory, or to pave a foundation for the numerical computation, mathematicians present variant computation model and computational complexity over reals, for example, the one in the book by Blum,Cucker,Shub, and Smale, or the one in Weihrauch's book Computable Analysis. mathematicians on such topics usually give the definition from their own view, and as far as I know, they usually do not compare their model with others. But we know, if they give a suitable model, eventually those variant model will be proven to be equivalent, as what had happened to the classic models.

So, first, let give a list of computation model and computational complexity over reals.

Second, are they equivalents? Any proof for their equivalence?

Obviously, the suitable models have to include the classic computation models as special case, and possibly,the computational complexity have to be consistent with the classic ones. As a special case, computable numbers ,especially computable irrational algebraic and transcendental ones have to have uniform or consistent definition over classic model and the computational complexity.