scholarly journals Modulo Codes with Summation of Weighted Transitions with Natural Number Sequence of Weights

2017 ◽  
Vol 1 (50) ◽  
pp. 137 ◽  
Author(s):  
Valery Vladimirovich Sapozhnikov ◽  
Vladimir Vladimirovich Sapozhnikov ◽  
Dmitry Viktorovich Efanov ◽  
Alexey Gennad`evich Kotenko
Keyword(s):  
Natural Number ◽  
Number Sequence

The Natural Numbers

2018 ◽  
Author(s):  
Øystein Linnebo
Keyword(s):  
Natural Number ◽  
Peano Arithmetic ◽  
Number Sequence ◽  
Natural Numbers ◽  
Ordinal Numbers ◽  
Cardinal Numbers

How are the natural numbers individuated? That is, what is our most basic way of singling out a natural number for reference in language or in thought? According to Frege and many of his followers, the natural numbers are cardinal numbers, individuated by the cardinalities of the collections that they number. Another answer regards the natural numbers as ordinal numbers, individuated by their positions in the natural number sequence. Some reasons to favor the second answer are presented. This answer is therefore developed in more detail, involving a form of abstraction on numerals. Based on this answer, a justification for the axioms of Dedekind–Peano arithmetic is developed.

Closed forms for convolutions of Catalan numbers

2012 ◽  
Vol 96 (535) ◽  
pp. 82-90 ◽  
Author(s):  
N. Gauthier
Keyword(s):  
Natural Number ◽  
Catalan Numbers ◽  
Number Sequence ◽  
Counting Problems

In Catalan numbers with applications [1], Thomas Koshy gives a clear and accessible account of some of the important characteristics of Catalan numbers. The author also discusses the significance of these numbers for mathematicians, scientists, engineers and amateur enthusiasts alike. The general contents of his book are reviewed in [2]. Catalan numbers, which are named after the mathematician Eugene Catalan (1814-1894), have very interesting and sometimes surprising properties.Catalan numbers occur in combinatorial mathematics, in particular, where they show up as a natural number sequence that arises in counting problems that usually involve recursively-defined objects.

A pair of rational double sequences

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Serik Altynbek ◽  
Heinrich Begehr
Keyword(s):  
Natural Number ◽  
Complex Plane ◽  
Rational Numbers ◽  
The Other ◽  
Number Sequence ◽  
Double Sequences ◽  
Natural Numbers ◽  
Reflection Process ◽  
Natural Way

Abstract Double sequences appear in a natural way in cases of iteratively given sequences if the iteration allows to determine besides the successors from the predecessors also the predecessors from their followers. A particular pair of double sequences is considered which appears in a parqueting-reflection process of the complex plane. While one end of each sequence is a natural number sequence, the other consists of rational numbers. The natural numbers sequences are not yet listed in OEIS Wiki. Complex versions from the double sequences are provided.

scholarly journals Arithmetic, enumerative induction and size bias

Synthese ◽  
2021 ◽  
Author(s):  
A. C. Paseau
Keyword(s):  
Number Theory ◽  
Natural Number ◽  
Arithmetic Property ◽  
Number Sequence ◽  
Size Bias ◽  
Goldbach’S Conjecture ◽  
Best Argument ◽  
Goldbach's Conjecture

AbstractNumber theory abounds with conjectures asserting that every natural number has some arithmetic property. An example is Goldbach’s Conjecture, which states that every even number greater than 2 is the sum of two primes. Enumerative inductive evidence for such conjectures usually consists of small cases. In the absence of supporting reasons, mathematicians mistrust such evidence for arithmetical generalisations, more so than most other forms of non-deductive evidence. Some philosophers have also expressed scepticism about the value of enumerative inductive evidence in arithmetic. But why? Perhaps the best argument is that known instances of an arithmetical conjecture are almost always small: they appear at the start of the natural number sequence. Evidence of this kind consequently suffers from size bias. My essay shows that this sort of scepticism comes in many different flavours, raises some challenges for them all, and explores their respective responses.

scholarly journals Deep ConvNet: Non-Random Weight Initialization for Repeatable Determinism, Examined with FSGM

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4772
Author(s):  
Richard N. M. Rudd-Orthner ◽  
Lyudmila Mihaylova
Keyword(s):  
Cross Validation ◽  
Color Image ◽  
Validation Dataset ◽  
Number Sequence ◽  
Random Weight ◽  
Fast Gradient ◽  
Weight Initialization ◽  
Fitting In ◽  
Sequence Substitution ◽  
Sign Method

A repeatable and deterministic non-random weight initialization method in convolutional layers of neural networks examined with the Fast Gradient Sign Method (FSGM). Using the FSGM approach as a technique to measure the initialization effect with controlled distortions in transferred learning, varying the dataset numerical similarity. The focus is on convolutional layers with induced earlier learning through the use of striped forms for image classification. Which provided a higher performing accuracy in the first epoch, with improvements of between 3–5% in a well known benchmark model, and also ~10% in a color image dataset (MTARSI2), using a dissimilar model architecture. The proposed method is robust to limit optimization approaches like Glorot/Xavier and He initialization. Arguably the approach is within a new category of weight initialization methods, as a number sequence substitution of random numbers, without a tether to the dataset. When examined under the FGSM approach with transferred learning, the proposed method when used with higher distortions (numerically dissimilar datasets), is less compromised against the original cross-validation dataset, at ~31% accuracy instead of ~9%. This is an indication of higher retention of the original fitting in transferred learning.

scholarly journals The Limits of Computation

Axiomathes ◽  
2021 ◽  
Author(s):  
Andrew Powell
Keyword(s):  
Natural Number ◽  
Set Theory ◽  
Lambda Calculus ◽  
Second Order ◽  
Functional Interpretation ◽  
Arbitrary Type ◽  
Computable Functions

AbstractThis article provides a survey of key papers that characterise computable functions, but also provides some novel insights as follows. It is argued that the power of algorithms is at least as strong as functions that can be proved to be totally computable in type-theoretic translations of subsystems of second-order Zermelo Fraenkel set theory. Moreover, it is claimed that typed systems of the lambda calculus give rise naturally to a functional interpretation of rich systems of types and to a hierarchy of ordinal recursive functionals of arbitrary type that can be reduced by substitution to natural number functions.

scholarly journals ADDITIVE BASES AND NIVEN NUMBERS

2021 ◽  
pp. 1-8
Author(s):  
CARLO SANNA
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Riemann Hypothesis ◽  
Additive Basis

Abstract Let $g \geq 2$ be an integer. A natural number is said to be a base-g Niven number if it is divisible by the sum of its base-g digits. Assuming Hooley’s Riemann hypothesis, we prove that the set of base-g Niven numbers is an additive basis, that is, there exists a positive integer $C_g$ such that every natural number is the sum of at most $C_g$ base-g Niven numbers.

A simple proof of existence of weak and statistical solutions of Navier–Stokes equations

1992 ◽  
Vol 436 (1896) ◽  
pp. 1-11 ◽  
Keyword(s):  
Weak Solution ◽  
Initial Data ◽  
Natural Number ◽  
Simple Proof ◽  
Stokes Equations ◽  
Galerkin Approximation ◽  
Navier Stokes ◽  
Navier Stokes Equations ◽  
Existence Proofs ◽  
Statistical Solutions

The Galerkin approximation to the Navier–Stokes equations in dimension N , where N is an infinite non-standard natural number, is shown to have standard part that is a weak solution. This construction is uniform with respect to non-standard representation of the initial data, and provides easy existence proofs for statistical solutions.

Sign in / Sign up

Export Citation Format

Share Document