Set-Theoretic Formalization of Computational Algorithms, Computable Functions, and General-Purpose Computers.

Roger Eli Levien

Expert InsightsPublished 1962

A formalization of the notion of computational algorithms. The corresponding class of algorithmically computable functions is identified, and the results are used to more clearly define "general-purpose computer." 35 pp.

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1962
  • Pages: 35
  • Document Number: P-2573

Citation

Chicago Manual of Style

Levien, Roger Eli, Set-Theoretic Formalization of Computational Algorithms, Computable Functions, and General-Purpose Computers. Santa Monica, CA: RAND Corporation, 1962. https://www.rand.org/pubs/papers/P2573.html.
BibTeX RIS

This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.