2019
DOI: 10.36285/tm.v0i0.13
|View full text |Cite
|
Sign up to set email alerts
|

Transreal Integral

Abstract: This paper improves an early approach and defines an integral on transreal numbers which extends the usual integral on real numbers. The present integral works on transreal numbers and integrates all functions which are properly or improperly integrable, in the usual sense, on real numbers.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…An author [14], unrelated to the author of the present paper, reviewed various approaches to division by zero and introduced the algebraic structure of a premeadow which generalises an associative transfield. A stronger transreal integral was introduced in [38] that is defined on the entire set of transreal numbers and integrates all functions which are properly or improperly integrable on real numbers. In [39], a technique called slipstreaming was described and illustrated an imple-mentation of the Fast Fourier Transform (FFT) on a fine-grained architecture that exploits the exception-free properties of transreal arithmetic to implement a statically assigned systolic dataflow.…”
Section: Transreal Arithmeticmentioning
confidence: 99%
“…An author [14], unrelated to the author of the present paper, reviewed various approaches to division by zero and introduced the algebraic structure of a premeadow which generalises an associative transfield. A stronger transreal integral was introduced in [38] that is defined on the entire set of transreal numbers and integrates all functions which are properly or improperly integrable on real numbers. In [39], a technique called slipstreaming was described and illustrated an imple-mentation of the Fast Fourier Transform (FFT) on a fine-grained architecture that exploits the exception-free properties of transreal arithmetic to implement a statically assigned systolic dataflow.…”
Section: Transreal Arithmeticmentioning
confidence: 99%
“…Given the ubiquitous practice with the use of the peripheral number +Inf in computing there has been remarkably little theoretical work on that matter. The main approach in this direction, named transreals, has been pioneered by James Anderson and his colleagues in a sequence of papers of which we mention [2,18] and [19]. For further work in this direction see [14].…”
mentioning
confidence: 99%