<--- Back to Details
First PageDocument Content
Theory of computation / Computer science / Computable function / Entscheidungsproblem / Algorithm / Primitive recursive function / Mathematical logic / Turing machine / Computability / Computability theory / Mathematics / Theoretical computer science
Date: 2008-06-27 06:21:18
Theory of computation
Computer science
Computable function
Entscheidungsproblem
Algorithm
Primitive recursive function
Mathematical logic
Turing machine
Computability
Computability theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 392,33 KB

Share Document on Facebook

Similar Documents

On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

DocID: 1vf5u - View Document

The Quadratic Assignment Problem in Code Optimization for a Simple Universal Turing Machine

DocID: 1uZDW - View Document

A clarification on Turing’s test and its implications for machine intelligence Phil Maguire () Philippe Moser () Department of Computer Science National University of Ireland, Maynoo

DocID: 1usTH - View Document

Extractors for Turing-machine sources Random 2012 Emanuele Viola Northeastern University

DocID: 1ukKA - View Document

1 Introduction The goal of getting computers to automatically solve problems is central to artificial intelligence, machine learning, and the broad area encompassed by what Turing called “machine intelligence” (Turin

DocID: 1uc6n - View Document