| slovo | definícia |
integer
(encz) | integer,celé číslo Zdeněk Brož |
integer
(encz) | integer,celočíselný adj: Zdeněk Brož |
Integer
(gcide) | Integer \In"te*ger\, n. [L. integer untouched, whole, entire.
See Entire.]
A complete entity; a whole number, in contradistinction to a
fraction or a mixed number.
[1913 Webster]
Complex integer (Theory of Numbers), an expression of the
form a + b[root]-1, where a and b are real integers.
[1913 Webster] |
integer
(wn) | integer
n 1: any of the natural numbers (positive or negative) or zero;
"an integer is a number that is not a fraction" [syn:
integer, whole number] |
integer
(foldoc) | integer
whole number
(Or "whole number") One of the numbers in the set
..., -3, -2, -1, 0, 1, 2, 3, ...
There are an infinite number of integers, though each one is
finite.
An inductive definition of an integer is a number that is either
zero or an integer plus or minus one.
An integer has no fractional part. If written as a real
number, e.g. 42.0, the part after the decimal point will be
zero.
A natural number is a non-negative integer.
Computers usually store integers in binary. Natural numbers can
be stored as unsigned integers and integers that may be negative
require a sign bit and typically use twos complement
representation. Other representations have been used, such as
binary-coded decimal.
Computers are particularly fast when operating on integers as
the operations are built into the central processing unit,
in contrast to floating point numbers, which typically
require the use of a separate floating-point unit.
(2019-08-31)
|
INTEGER
(bouvier) | INTEGER. Whole, untouched. Res integra means a question which is new and
undecided. 2 Kent, Com. 177.
|
| | podobné slovo | definícia |
integer
(encz) | integer,celé číslo Zdeněk Brožinteger,celočíselný adj: Zdeněk Brož |
integers
(encz) | integers,celá čísla n: Zdeněk Brož |
large integer
(encz) | large integer, n: |
Complex integer
(gcide) | Integer \In"te*ger\, n. [L. integer untouched, whole, entire.
See Entire.]
A complete entity; a whole number, in contradistinction to a
fraction or a mixed number.
[1913 Webster]
Complex integer (Theory of Numbers), an expression of the
form a + b[root]-1, where a and b are real integers.
[1913 Webster] |
Integer
(gcide) | Integer \In"te*ger\, n. [L. integer untouched, whole, entire.
See Entire.]
A complete entity; a whole number, in contradistinction to a
fraction or a mixed number.
[1913 Webster]
Complex integer (Theory of Numbers), an expression of the
form a + b[root]-1, where a and b are real integers.
[1913 Webster] |
fraxinus pennsylvanica subintegerrima
(wn) | Fraxinus pennsylvanica subintegerrima
n 1: a variety of red ash having glossy branchlets and lower
leaf surfaces [syn: green ash, {Fraxinus pennsylvanica
subintegerrima}] |
integer
(wn) | integer
n 1: any of the natural numbers (positive or negative) or zero;
"an integer is a number that is not a fraction" [syn:
integer, whole number] |
large integer
(wn) | large integer
n 1: an integer equal to or greater than ten |
church integer
(foldoc) | Church integer
A representation of integers as functions invented by
Alonzo Church, inventor of lambda-calculus. The integer N
is represented as a higher-order function which applies a
given function N times to a given expression. In the {pure
lambda-calculus} there are no constants but numbers can be
represented by Church integers.
A Haskell function to return a given Church integer could be
written:
church n = c
where
c f x = if n == 0 then x else c' f (f x)
where
c' = church (n-1)
A function to turn a Church integer into an ordinary integer:
unchurch c = c (+1) 0
See also von Neumann integer.
(1994-11-29)
|
integer
(foldoc) | integer
whole number
(Or "whole number") One of the numbers in the set
..., -3, -2, -1, 0, 1, 2, 3, ...
There are an infinite number of integers, though each one is
finite.
An inductive definition of an integer is a number that is either
zero or an integer plus or minus one.
An integer has no fractional part. If written as a real
number, e.g. 42.0, the part after the decimal point will be
zero.
A natural number is a non-negative integer.
Computers usually store integers in binary. Natural numbers can
be stored as unsigned integers and integers that may be negative
require a sign bit and typically use twos complement
representation. Other representations have been used, such as
binary-coded decimal.
Computers are particularly fast when operating on integers as
the operations are built into the central processing unit,
in contrast to floating point numbers, which typically
require the use of a separate floating-point unit.
(2019-08-31)
|
integer specbaserate
(foldoc) | Integer SPECbaserate
SPECrate_base_int92
|
integer specbaseratio
(foldoc) | SPECbase_int92
Integer SPECbaseratio
A variant of SPECint92 that reports "baseline" results,
using stricter run rules.
(1994-11-14)
|
integer specrate
(foldoc) | SPECrate_int92
Integer SPECrate
The integer SPECrate derived from the results of
a set of integer benchmarks (the geometric mean of six {SPEC
rates} from CINT92) run multiple times simultaneously, and
can be used to estimate a machine's overall multi-tasking
throughput for integer code. It is typically used on
multiprocessor machines.
SPECrate_int92 obsoletes SPECintThruput89.
See also SPECbaserate.
(1994-11-14)
|
integer specratio
(foldoc) | SPECint92
Integer SPECratio
A benchmark result derived from the results of a
set of integer benchmarks from SPEC (geometric mean of the 6
SPEC ratios of CINT92) which can be used to estimate a
machine's single-tasking performance on integer code.
SPECint92 obsoletes SPECint89.
Results (ftp://ftp.nosc.mil/pub/aburto/specin92.tbl).
See also SPECbase_int92.
(1994-11-14)
|
von neumann integer
(foldoc) | von Neumann integer
A finite von Neumann ordinal.
The von Neumann integer N is a finite set with N elements
which are the von Neumann integers 0 to N-1. Thus
0 = {} = {}
1 = 0 = {}
2 = 0, 1 = {, {}}
3 = 0, 1, 2 = {, {}, {, {}}}
...
The set of von Neumann integers is infinite, even though
each of its elements is finite.
[Origin of name?]
(1995-03-30)
|
|