最終更新日:2022/12/24
In the 1930s, while Turing was developing what are now called ‘Turing machines’ as a model for computation, Church and his student Kleene were developing a different model, called the ‘lambda calculus’ [29, 63]. While a Turing machine can be seen as an idealized, simplified model of computer hardware, the lambda calculus is more like a simple model of software.
編集履歴(0)
元となった例文
In
the
1930s,
while
Turing
was
developing
what
are
now
called
‘Turing
machines’
as
a
model
for
computation,
Church
and
his
student
Kleene
were
developing
a
different
model,
called
the
‘lambda
calculus’
[29,
63].
While
a
Turing
machine
can
be
seen
as
an
idealized,
simplified
model
of
computer
hardware,
the
lambda
calculus
is
more
like
a
simple
model
of
software.