Results 111 to 120 of about 2,083,882 (139)
, 2020 Engineering schoolAlan Turing publie en 1936 un article où il répond négativement à une question de logique formelle, « Peut-on concevoir un algorithme qui décide si une formule du calcul des prédicats est provable ou non ? ».
Ridoux, Olivier
core
Turing Machine Simulator and its Underlying Mechanism [PDF]
, 2019 Turing machines(TMs) are mathematical models of computation that define abstract machines. Because of their simplicity and consistency, they are amenable to mathematical analysis.
Zhang, Hang
core
, 2014 The Turing Machine Cross media concept is based on the life of Alan Turing (1912-1954), who was a wartime code-breaker and pioneer of computer science – often considered the father of modern computing.
Saarinen, L. +4 more
core
The Turing Machine and Computability
, 2007 In this project we look at Turing Machines and how they are used to prove properties about various problems. We examine the concept of multiple tape Turing Machines and how they relate to nondeterministic Turing Machines.
Farrel Lifson September
core
Ce document vous présente mon pro jet de semestre dont le titre original est Turing machine emulator. Le but de ce projet a été d'implémenter un système capable d'émuler certaines abstractions des machines de Turing.
Favre, Ludovic
core +1 more source
Is wave propagation computable or can wave computers beat the Turing machine?
, 2002 By the Church-Turing Thesis a numerical function is computable by a physical device if and only if it is computable by a Turing machine. The `if'-part is plausible since every (sufficiently small) Turing machine can be simulated by a computer ...
Klaus Weihrauch, Ning Zhong
core
, 2002 • K is a finite set of states • s K is the initial state • Σ is a finite set of symbols (Σ is the alphabet) • Σ always contains the special symbols š and denoting the blank and first symbols What is a Turing Machine?
core
Universal turing machine (UTM)
, 1999 One of the most controversial issues to date is that of the origin of the modern digital computer. Majority believed that the foundation of the modern digital computer date only to as far back as the Von Neumann architecture in 1940\u27s.
Go, Christopher C. +3 more
core
The Complexity of Small Universal Turing Machines: A Survey [PDF]
Theoretical Computer Science, 2009 We survey some work concerned with small universal Turing machines, cellular automata, tag systems, and other simple models of computation. For example it has been an open question for some time as to whether the smallest known universal Turing machines ...
Damien Woods, Turlough Neary
exaly +2 more sources