- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
An Implementation of Lipschitz Simple Functions in Computer Algebra System Singular
Yanan Liu, Muhammad Ahsan Binyamin, Adnan Aslam, Minahal Arshad, Chengmei Fan, Hassan Mahmood & Jia-Bao Liu
Complexity 2021:1-5 (2021)
Abstract
A complete classification of simple function germs with respect to Lipschitz equivalence over the field of complex numbers ℂ was given by Nguyen et al. The aim of this article is to implement a classifier in terms of easy computable invariants to compute the type of the Lipschitz simple function germs without computing the normal form in the computer algebra system Singular.Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
On the computational complexity of integral equations.Ker-I. Ko - 1992 - Annals of Pure and Applied Logic 58 (3):201-228.
The Norton-type lipschitz-indeterministic systems and elastic phenomena: Indeterminism as an artefact of infinite idealizations.Alexandre Korolev - unknown
Equivalence between Wadge and Lipschitz determinacy.Alessandro Andretta - 2003 - Annals of Pure and Applied Logic 123 (1-3):163-192.
Approximation of o-minimal maps satisfying a Lipschitz condition.Andreas Fischer - 2014 - Annals of Pure and Applied Logic 165 (3):787-802.
Group configurations and germs in simple theories.Itay Ben-Yaacov - 2002 - Journal of Symbolic Logic 67 (4):1581-1600.
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
Maximal pairs of c.e. reals in the computably Lipschitz degrees.Yun Fan & Liang Yu - 2011 - Annals of Pure and Applied Logic 162 (5):357-366.
The elementary computable functions over the real numbers: applying two new techniques. [REVIEW]Manuel L. Campagnolo & Kerry Ojakian - 2008 - Archive for Mathematical Logic 46 (7-8):593-627.
Analytics
Added to PP
2021-04-02
Downloads
24 (#679,414)
6 months
17 (#161,763)
2021-04-02
Downloads
24 (#679,414)
6 months
17 (#161,763)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-s5tms uwo