Yahoo Search Busca da Web

Resultado da Busca

  1. Alonzo Church (Washington, DC, 14 de junho de 1903 — Hudson (Ohio), 8 de novembro de 1995) foi um matemático estadunidense. Atuou principalmente nas áreas de lógica matemática , teoria da recursão e teoria da computação .

  2. Alonzo Church (June 14, 1903 – August 11, 1995) was an American mathematician, computer scientist, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science.

  3. The thesis is named after American mathematician Alonzo Church and the British mathematician Alan Turing. Before the precise definition of computable function, mathematicians often used the informal term effectively calculable to describe functions that are computable by paper-and-pencil methods.

  4. It was introduced by the mathematician Alonzo Church in the 1930s as part of his research into the foundations of mathematics . Lambda calculus consists of constructing lambda terms and performing reduction operations on them. In the simplest form of lambda calculus, terms are built using only the following rules: [a]

  5. 21 de out. de 2021 · First published Thu Oct 21, 2021; substantive revision Thu Feb 24, 2022. Alonzo Church (1903–1995) was a renowned mathematical logician, philosophical logician, philosopher, teacher and editor. He was one of the founders of the discipline of mathematical logic as it developed after Cantor, Frege and Russell.

  6. 11 de ago. de 1995 · Quick Info. Born. 14 June 1903. Washington, D.C., USA. Died. 11 August 1995. Hudson, Ohio, USA. Summary. Alonzo Church made important contributions to mathematical logic and theoretical computer science. View two larger pictures. Biography. Alonzo Church's parents were Mildred Hannah Letterman Parker and Samuel Robbins Church.

  7. De Wikipedia, a enciclopédia livre. Alonzo Church ( Washington, DC, 14 de junho de 1903 — Hudson (Ohio), 8 de novembro de 1995) foi um matemático estadunidense. Atuou principalmente nas áreas de lógica matemática, teoria da recursão e teoria da computação.