Results 1  10
of
1,539,505
A Universal Turing Machine with Zero Internal States
"... Abstract. Can we define the simplest Universal Turing Machine (UTM) as a structure containing only uniform circuits? Is there possible a 0state machine containing only structures having constant sized simple definitions. In a 0state UTM all random structures are missing, and the resulting system e ..."
Abstract
 Add to MetaCart
Abstract. Can we define the simplest Universal Turing Machine (UTM) as a structure containing only uniform circuits? Is there possible a 0state machine containing only structures having constant sized simple definitions. In a 0state UTM all random structures are missing, and the resulting system
ÂLes ordinateurs et l’intelligenceÂ Universal Turing Machine
"... The synthesis of consistent hashing is a key quagmire. This is an important point to understand. in fact, few biologists would disagree with the evaluation of the lookaside buffer, which embodies the practical principles of steganography. In order to achieve this ambition, we concentrate our efforts ..."
Abstract
 Add to MetaCart
The synthesis of consistent hashing is a key quagmire. This is an important point to understand. in fact, few biologists would disagree with the evaluation of the lookaside buffer, which embodies the practical principles of steganography. In order to achieve this ambition, we concentrate our
ÂDigital Computers Applied to GamesÂ Universal Turing Machine
"... DHCP and sensor networks, while key in theory, have not until recently been considered structured. Given the current status of decentralized models, statisticians clearly desire the simulation of active networks, which embodies the robust principles of networking. Our focus here is not on whether ca ..."
Abstract
 Add to MetaCart
DHCP and sensor networks, while key in theory, have not until recently been considered structured. Given the current status of decentralized models, statisticians clearly desire the simulation of active networks, which embodies the robust principles of networking. Our focus here is not on whether cache coherence
Outline • What is a Turing Machine? (a quick intro) • Construction of a Universal Turing Machine What is a Turing Machine?
, 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? (continued) • is the transition function which maps: K × Σ to (K {h, “yes”, “no”}) ..."
Abstract
 Add to MetaCart
š) Construction of a Universal Turing Machine • A universal Turing machine interprets the input as a description of another Turing machine M, concatenated with a description of the input x. • We denote it as U(M; x) = M(x) • Assumptions: – no priori bounds on number of states and symbols that U
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 452 (3 self)
 Add to MetaCart
this formalism has advantages both as a programming language and as a vehicle for developing a theory of computation. Next, we describe Sexpressions and Sfunctions, give some examples, and then describe the universal Sfunction apply which plays the theoretical role of a universal Turing machine
Maté: A Tiny Virtual Machine for Sensor Networks
, 2002
"... Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopulate. ..."
Abstract

Cited by 502 (21 self)
 Add to MetaCart
late. Often there is no feasible method to recharge motes, so energy is a precious resource. Once deployed, a network must be reprogrammable although physically unreachable, and this reprogramming can be a significant energy cost. We present Maté, a tiny communicationcentric virtual machine designed
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical
Live Migration of Virtual Machines
 In Proceedings of the 2nd ACM/USENIX Symposium on Networked Systems Design and Implementation (NSDI
, 2005
"... Migrating operating system instances across distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean separation between hardware and software, and facilitates fault management, load balancing, and lowlevel system maintenance. By carrying out the ma ..."
Abstract

Cited by 613 (14 self)
 Add to MetaCart
Migrating operating system instances across distinct physical hosts is a useful tool for administrators of data centers and clusters: It allows a clean separation between hardware and software, and facilitates fault management, load balancing, and lowlevel system maintenance. By carrying out
Ensemble Methods in Machine Learning
 MULTIPLE CLASSIFIER SYSTEMS, LBCS1857
, 2000
"... Ensemble methods are learning algorithms that construct a set of classifiers and then classify new data points by taking a (weighted) vote of their predictions. The original ensemble method is Bayesian averaging, but more recent algorithms include errorcorrecting output coding, Bagging, and boostin ..."
Abstract

Cited by 607 (3 self)
 Add to MetaCart
Ensemble methods are learning algorithms that construct a set of classifiers and then classify new data points by taking a (weighted) vote of their predictions. The original ensemble method is Bayesian averaging, but more recent algorithms include errorcorrecting output coding, Bagging
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a
Results 1  10
of
1,539,505