A Mechanical Proof of the Turing Completeness of Pure Lisp

Contemporary Mathematics - United States
doi 10.1090/conm/029/08
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

American Mathematical Society

Related search

Turing Test as a Defining Feature of AI-Completeness

Studies in Computational Intelligence
Artificial Intelligence
2013English

A Proof of the Completeness Theorem of Grödel

Fundamenta Mathematicae
Number TheoryAlgebra
1950English

The Proof of the Riemann Hypothesis on a Relativistic Turing Machine

International Journal of Theoretical and Applied Mathematics
2017English

A Model-Based Completeness Proof of Extended Narrowing and Resolution

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

PB-277 Literal Resolution: A Simple Proof of Resolution Completeness

DAIMI Report Series
1989English

Extracting the Resolution Algorithm From a Completeness Proof for the Propositional Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Simple Proof for Goofspiel: The Game of Pure Strategy

Advances in Applied Probability
Applied MathematicsStatisticsProbability
1989English

Simple Proof for Goofspiel: The Game of Pure Strategy

Advances in Applied Probability
Applied MathematicsStatisticsProbability
1989English

A LISP Programming Exercise

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy