# Numbers and Computers

```@inproceedings{Kneusel2015NumbersAC,
title={Numbers and Computers},
author={Ronald T. Kneusel},
booktitle={Springer International Publishing},
year={2015}
}```
• R. T. Kneusel
• Published in
Springer International…
15 April 2015
• History
Computers use number bases other than the traditional base 10. In this chapter we take a look at number bases focusing on those most frequently used in association with computers. We look at how to construct numbers in these bases as well as how to move numbers between different bases. 1.1 Representing Numbers The ancient Romans used letters to represent their numbers. These are the “Roman numerals” which are often taught to children, I 1 II 2 III 3 IV 4 (1 before 5) V 5 X 10 L 50 C 100 D 500 M…
4 Citations
Parametric Intervals: More Reliable or Foundationally Problematic?
• Mathematics
• 2019
It is argued that the theory of parametric intervals does not provide a radical solution to the long-standing dependency problem in the classical interval theory.
Towards Numerical Assistants - Trust, Measurement, Community, and Generality for the Numerical Workbench
• Computer Science
VSTTE
• 2020
The experience of adapting Herbie, a tool for numerical error repair, from a research prototype to a reliable workhorse for daily use is described and it is shown that community development and an investment in the generality of the authors' tools, such as through the FPBench project, will better support users and strengthen the research community.
A Logical Formalization of the Notion of Interval Dependency: Towards Reliable Intervalizations of Quantifiable Uncertainties
• Mathematics
• 2019
This article is devoted to presenting a complete systematic formalization of the notion of interval dependency, by means of the notions of Skolemization and quantification dependence, to shed new light on some fundamental problems of interval mathematics and to take one small step towards paving the way for developing alternate dependency-aware interval theories and computational methods.
A study of interval optimization problems
• Mathematics
Optim. Lett.
• 2021
Borders for the asymptotic cones of level, colevel and solution sets are obtained that allow us to deduce coercivity properties and coercive existence results.

## References

SHOWING 1-10 OF 43 REFERENCES
Fast recursive division
• Mathematics, Computer Science
• 1998
A new recursive method for division with remainder of integers is presented and practical results of an implementation allow us to say that the authors have the fastest integer division on a SPARC architecture compared to all other integer packages they know of.
Prime Numbers: A Computational Perspective
• Mathematics
• 2002
Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book,
An Algorithm for Exact Division
An algorithm which computes the quotient of two long integers in this particular situation, starting from the least-significant digits of the operands, which is better suited for systolic parallelization in a "least-significant digit first" pipelined manner.
Interval Computations: Introduction, Uses, and Resources
This article introduces interval arithmetic and its interaction with established mathematical theory, and provides pointers to traditional literature collections, as well as electronic resources.
Verified Real Number Calculations: A Library for Interval Arithmetic
• Mathematics, Computer Science
IEEE Transactions on Computers
• 2009
This paper formally establishes upper and lower bounds for elementary functions, and develops a rational interval arithmetic where real number calculations take place in an algebraic setting, in order to reduce the dependency effect of interval arithmetic.
Handbook of Floating-Point Arithmetic
• Computer Science
• 2009
The Handbook of Floating-point Arithmetic is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research.
The First Report on Scheme Revisited
• Computer Science
High. Order Symb. Comput.
• 1998
Scheme was designed to be the next in a long series of programming languages that had been designed at MIT over the course of 17 years, and the principal themes were complex data structures with automatic pattern matching, and complex control structures withautomatic backtracking.
Definition of the Arithmetic Operations and Comparison Relations for an Interval Arithmetic
• Computer Science, Mathematics
Reliab. Comput.
• 2011
The definition of the arithmetic operations and of comparison relations for an interval arithmetic computation standard is considered and hardware support for the operations and comparison relations is given.
Interval arithmetic: From principles to implementation
• Mathematics, Computer Science
JACM
• 2001
It is shown that the IEEE standard's specification of operations involving the signed infinities, signed zeros, and the exact/inexact flag are such as to make a correct and optimal implementation more efficient.
Exponentiation Cryptosystems on the IBM PC
• P. Comba
• Computer Science
IBM Syst. J.
• 1990
A mixed system that combines the superior key management capabilities inherent in public key cryptosystems with the much higher bulk-encryption speed obtainable with the Data Encryption Algorithm is discussed.