56
56

texts

#
eye 56

#
favorite 3

#
comment 0

xiv, 661 p. : 25 cm

Topic: Turing machines

111
111

Sep 14, 2010
09/10

by
Strathern, Paul, 1940-

texts

#
eye 111

#
favorite 4

#
comment 0

Includes bibliographical references (p. 105)

Topics: Computers, Turing machines

10
10.0

Jan 10, 2020
01/20

by
Szepietowski, Andrzej

texts

#
eye 10

#
favorite 0

#
comment 0

viii, 114 p. ; 24 cm

Topics: Turing machines, Computational complexity

8
8.0

Sep 28, 2020
09/20

by
Loeckx, Jacques, 1931-

texts

#
eye 8

#
favorite 0

#
comment 0

vi, 76 p. 26 cm

Topics: Sequential machine theory, Turing machines

This volume was digitized and made accessible online due to deterioration of the original print copy.

Topics: Turing machines, Algebraic functions--Computer programs.

316
316

Sep 3, 2019
09/19

by
Davis, Martin, 1928-

texts

#
eye 316

#
favorite 3

#
comment 0

440 p. 24 cm

Topics: Gödel's theorem, Recursive functions, Turing machines

9
9.0

Oct 24, 2020
10/20

by
Loeckx, Jacques, 1931-

texts

#
eye 9

#
favorite 0

#
comment 0

vi, 76 pages 26 cm

Topics: Turing machines, Sequential machine theory, Machines Turing, Machines séquentielles (Théorie),...

115
115

Sep 2, 2019
09/19

by
Hennie, Frederick C

texts

#
eye 115

#
favorite 1

#
comment 0

ix, 374 p. : 25 cm

Topics: Algorithms, Computational complexity, Recursive functions, Turing machines

"BCL no. 252."

Topics: Recursion theory, Pattern recognition systems, Turing machines

673
673

Oct 28, 2010
10/10

by
Hillis, W. Daniel

texts

#
eye 673

#
favorite 15

#
comment 0

Includes bibliographical references (p. 155) and index

Topics: Computers, Ordinateurs, Turing, Machines de, Parallélisme (informatique)

355
355

Jun 13, 2011
06/11

by
Bents, David J.; Scullin, Vincent J.; Chang, Bei-Jiann; Johnson, Donald W.; Garcia, Christoher P.; Jakupca, Ian J

texts

#
eye 355

#
favorite 0

#
comment 0

The closed-cycle hydrogen-oxygen PEM regenerative fuel cell (RFC) at the NASA Glenn Research Center has successfully demonstrated closed cycle operation at rated power for multiple charge-discharge cycles. During charge cycle the RFC has absorbed input electrical power simulating a solar day cycle ranging from zero to 15 kWe peak, and delivered steady 5 kWe output power for periods exceeding 8 hr. Orderly transitions from charge to discharge mode, and return to charging after full discharge,...

Topics: TOPOLOGY, TURING MACHINES, MANIFOLDS (MATHEMATICS), COMPUTATION, PROVING, CLASSIFICATIONS

39
39

Oct 10, 2018
10/18

by
Jones, Neil D

texts

#
eye 39

#
favorite 0

#
comment 0

xiv, 154 pages 24 cm

Topics: Recursive functions, Turing machines, Computable functions, Berechenbarkeit, Computer, Theorie,...

449
449

Jan 17, 2020
01/20

by
Petzold, Charles, 1953-

texts

#
eye 449

#
favorite 20

#
comment 0

xii, 372 p. : 23 cm

Topics: Turing, Alan Mathison, 1912-1954, Turing machines, Computational complexity

93
93

Jan 24, 2012
01/12

by
Barwise, Jon; Etchemendy, John, 1952-

texts

#
eye 93

#
favorite 1

#
comment 0

System requirements for computer disk: Macintosh

Topics: Turing's world, Computer science, Logic, Symbolic and mathematical, Turing machines

221
221

Jun 26, 2010
06/10

by
Appler, R. L

texts

#
eye 221

#
favorite 0

#
comment 0

Optical device containing rotatable prism and reflecting mirror for generating precise angles

Topics: COMPUTER PROGRAMMING, LOGICAL ELEMENTS, TURING MACHINES, COMPUTATION, FUNCTIONS (MATHEMATICS),...

208
208

Jul 12, 2010
07/10

by
Chiu, Y. T.; Chakrabarti, S.; Paresce, F.; Bowyer, S.; Aikin, A

texts

#
eye 208

#
favorite 0

#
comment 0

High sensitivity and spatial resolution observations of the He(2)II-304 A emission line intensity in the Earth's nightglow have been carried out by the extreme ultraviolet telescope on the Apollo-Soyuz mission in July 1975. The data, obtained over a wide range of parameters, are compared with the predictions of a kinetic equilibrium model of plasmaspheric ion density. Excellent overall agreement observation and theory is found using as inputs a temperature model, solar flux, and H and O number...

Topics: COMPUTER PROGRAMMING, OPERATING SYSTEMS (COMPUTERS), PROGRAM VERIFICATION (COMPUTERS), TURING...

229
229

Sep 20, 2010
09/10

by
Hagood, Nesbitt W.; Crawley, Edward F

texts

#
eye 229

#
favorite 0

#
comment 0

Viewgraphs on cost averaging techniques for robust control of flexible structural systems are presented. Topics covered include: modeling of parameterized systems; average cost analysis; reduction of parameterized systems; and static and dynamic controller synthesis.

Topics: ECONOMIC ANALYSIS, ROBOTS, ECONOMICS, ECONOMY, POLICIES, THEOREM PROVING, TURING MACHINES,...

375
375

May 30, 2011
05/11

by
Maestrello, Luci

texts

#
eye 375

#
favorite 0

#
comment 0

An investigation of the control of turbulent boundary layer flow over flexible and rigid surfaces downstream of a concave-convex geometry has been made. The concave-convex curvature induces centrifugal forces and a pressure gradient on the growth of the turbulent boundary layer. The favorable gradient is not sufficient to overcome the unfavorable; thus, the net effect is a destabilizing, of the flow into Gortler instabilities. This study shows that control of the turbulent boundary layer and...

Topics: COMPUTER TECHNIQUES, COMPUTERS, ALGORITHMS, COMPUTER SYSTEMS PERFORMANCE, TURING MACHINES, ERROR...

240
240

Jul 5, 2017
07/17

by
Carpenter, Brian E; Doran, R. W; Turing, Alan Mathison, 1912-1954. Proposal for development in the Mathematics Division of an automatic computing engine (ACE). 1986; Turing, Alan Mathison, 1912-1954. Lecture to the London Mathematical Society on 20 February 1947. 1986; Woodger, Michael. History and present use of digital computers at the National Physical Laboratory. 1986

texts

#
eye 240

#
favorite 3

#
comment 0

Volume 10 in the Babbage Reprint Series contains two archival papers by Alan Turing-the ACE report (1945), a seminal paper detailing the design for an electronic universal machine called the Automatic Computing Engine (ACE), and Turing's Lecture to the London Mathematical Society (1947) amplifying the ideas outlined in the ACE report. Turing's report was the first time that the notion of artificial intelligence was discussed as a real possibility and Turing went on to devote the next decade to...

Topics: Calculators, Electronic digital computers, Turing, ACE, historique ordinateur, Ordinateurs,...

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly...

Topics: NASA Technical Reports Server (NTRS), TOPOLOGY, TURING MACHINES, MANIFOLDS (MATHEMATICS),...

A property of polynomial complete languages is extended in order to better compare various classes of formal languages defined by time- or tape-bounded turing machines.

Topics: NASA Technical Reports Server (NTRS), ASSEMBLY LANGUAGE, TURING MACHINES, COMPUTERS, HIERARCHIES,...

Continuous dynamical systems intuitively seem capable of more complex behavior than discrete systems. If analyzed in the framework of the traditional theory of computation, a continuous dynamical system with countably many quasistable states has at least the computational power of a universal Turing machine. Such an analysis assumes, however, the classical notion of measurement. If measurement is viewed nonclassically, a continuous dynamical system cannot, even in principle, exhibit behavior...

Topics: NASA Technical Reports Server (NTRS), ARTIFICIAL INTELLIGENCE, DYNAMICAL SYSTEMS, MEASUREMENT,...

112
112

Jun 16, 2021
06/21

by
Dyson, George, 1953-

texts

#
eye 112

#
favorite 6

#
comment 0

xxii, 401 pages : 21 cm

Topics: Von Neumann, John, 1903-1957, Turing, Alan, 1912-1954, Computers -- History, Turing machines,...

ISBN: 0 8053 0143 7

Topics: Theory of Computation, Machine theory, Computational complexity, Automata, Turing Machines, Bare...

A method to define the labels of the state diagram of a linear finite-state code is presented and investigated. This method is particularly suitable for simple hardware implementation since it simplifies the encoder structure. The method can also be applied to the labeling of a state diagram that is not completely connected to obtain a linear finite state code with larger free distance.

Topics: NASA Technical Reports Server (NTRS), CODING, MARKING, SHIFT REGISTERS, TURING MACHINES,...

It is shown that a self organizing system has two main components: an organizable physical part, and a programing part. This report presents the organizable part in the form of a programable hardware and its programing language.

Topics: NASA Technical Reports Server (NTRS), COMPUTER PROGRAMMING, MACHINE LEARNING, SELF ORGANIZING...

14
14

May 12, 2022
05/22

by
Rayward-Smith, V. J

texts

#
eye 14

#
favorite 2

#
comment 0

xv, 182 pages : 24 cm

Topics: Electronic digital computers, Turing machines, Computable functions -- Data processing, Computers,...

125
125

Feb 26, 2019
02/19

by
Computerphile

movies

#
eye 125

#
favorite 0

#
comment 0

Alan Turing almost accidentally created the blueprint for the modern day digital computer. Here Mark Jago takes us through The Halting Problem. Turing Machines Explained: https://youtu.be/dNRDvLACg5Q Busy Beaver: https://youtu.be/CE8UhcyJS0I VR Simulator: http://youtu.be/Lm0lA0enPSk What on Earth is Recursion?: http://youtu.be/Mv9NEXX1VHc Thanks to Assistant Professor Mark Jago of the University of Nottingham. http://www.facebook.com/computerphile https://twitter.com/computer_phile This video...

Topics: Youtube, video, Education, computers, computerphile, halting problem, alan turing, mathematics,...

The automatic generation of test cases is an important issue for conformance testing of several critical systems. We present a new method for the derivation of test suites when the specification is modeled as a combined Finite State Machine (FSM). A combined FSM is obtained conjoining previously tested submachines with newly added states. This new concept is used to describe a fault model suitable for incremental testing of new systems, or for retesting modified implementations. For this fault...

Topics: NASA Technical Reports Server (NTRS), TURING MACHINES, MATHEMATICAL LOGIC, PROVING, PROGRAM...

From the bitsavers.org collection, a scanned-in computer-related document. mit :: ai :: aim :: AIM-036

Topics: sequence, vector, computable, machines, guesses, machine, finite, random, scanning, effectively,...

In the first of this pair of papers, it was proven that there cannot be a physical computer to which one can properly pose any and all computational tasks concerning the physical universe. It was then further proven that no physical computer C can correctly carry out all computational tasks that can be posed to C. As a particular example, this result means that no physical computer that can, for any physical system external to that computer, take the specification of that external system's...

Topics: NASA Technical Reports Server (NTRS), COMPUTER TECHNIQUES, COMPUTERS, ALGORITHMS, COMPUTER SYSTEMS...

Research is reported dealing with problems of digital data transmission and computer communications networks. The results of four individual studies are presented which include: (1) signal processing with finite state machines, (2) signal parameter estimation from discrete-time observations, (3) digital filtering for radar signal processing applications, and (4) multiple server queues where all servers are not identical.

Topics: NASA Technical Reports Server (NTRS), DIGITAL DATA, TELECOMMUNICATION, DIGITAL FILTERS,...

In developing the first version of a generic implementation of X.25, Levels 2 and 3, three development techniques are examined: table driven finite state machine implementation, an integrated testing environment, and top down design. A finite state machine (FSM) is a powerful tool for both specifying and implementing protocols. This technique was used in the X.25 specification. A table driven implementation of the FSM was chosen to facilitate changes and simplify coding. The effect that this...

Topics: NASA Technical Reports Server (NTRS), COMPUTER PROGRAMMING, OPERATING SYSTEMS (COMPUTERS), PROGRAM...

Artificial Intelligence research has come under fire for failing to fulfill its promises. A growing number of AI researchers are reexamining the bases of AI research and are challenging the assumption that intelligent behavior can be fully explained as manipulation of symbols by algorithms. Three recent books -- Mind over Machine (H. Dreyfus and S. Dreyfus), Understanding Computers and Cognition (T. Winograd and F. Flores), and Brains, Behavior, and Robots (J. Albus) -- explore alternatives and...

Topics: NASA Technical Reports Server (NTRS), ARTIFICIAL INTELLIGENCE, COGNITION, DECISION MAKING, EXPERT...

In this paper we study the difficulty of solving problems in economics. For this purpose, we adopt the notion of undecidability from recursion theory. We show that certain problems in economics are undecidable, i.e., cannot be solved by a Turing Machine, a device that is at least as powerful as any computational device that can be constructed. In particular, we prove that even in finite closed economies subject to a variable initial condition, in which a social planner knows the behavior of...

Topics: NASA Technical Reports Server (NTRS), ECONOMIC ANALYSIS, ECONOMICS, ECONOMY, POLICIES, THEOREM...

The growing demand for intelligent information systems requires closer coupling of rule-based reasoning engines, such as CLIPS, with advanced data base management systems (DBMS). For instance, several commercial DBMS now support the notion of triggers that monitor events and transactions occurring in the database and fire induced actions, which perform a variety of critical functions, including safeguarding the integrity of data, monitoring access, and recording volatile information needed by...

Topics: NASA Technical Reports Server (NTRS), DATA BASE MANAGEMENT SYSTEMS, EXPERT SYSTEMS, INFORMATION...

Statecharts is a visual language for specifying the behavior of reactive systems. The Language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded system, precisely defining its semantics has proved extremely challenging. In this paper, a simple process algebra, called Statecharts Process Language (SPL), is presented, which is expressive enough for encoding Statecharts in a structure-preserving and...

Topics: NASA Technical Reports Server (NTRS), ALGEBRA, SEMANTICS, MATHEMATICAL MODELS, COMPUTERIZED...

This thesis investigates the effects of the High Power Amplifier (HPA) and the filters over a satellite or telemetry channel. The Volterra series expression is presented for the nonlinear channel with memory, and the algorithm is based on the finite-state machine model. A RAM-based algorithm operating on the receiver side, Pre-cursor Enhanced RAM-FSE Canceler (PERC) is developed. A high order modulation scheme , 16-QAM is used for simulation, the results show that PERC provides an efficient and...

Topics: NASA Technical Reports Server (NTRS), POWER AMPLIFIERS, QUADRATURE AMPLITUDE MODULATION,...

A generalized problem of stochastic control is discussed in which multiple controllers with different data bases are present. The vehicle for the investigation is the finite state, finite memory (FSFM) stochastic control problem. Optimality conditions are obtained by deriving an equivalent deterministic optimal control problem. A FSFM minimum principle is obtained via the equivalent deterministic problem. The minimum principle suggests the development of a numerical optimization algorithm, the...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, INFORMATION THEORY, OPTIMAL CONTROL, STOCHASTIC...

A general construction for finite-state (FS) codes is applied to some well-known block codes. Subcodes of the (24,12) Golay code are used to generate two optimal FS codes with d sub free = 12 and 16. A partition of the (16,8) Nordstrom-Robinson code yields a d sub free = 10 FS code. Simulation results are shown and decoding algorithms are briefly discussed.

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, CODING, DECODERS, ERROR CORRECTING CODES, TURING...

15
15

Jul 12, 2021
07/21

by
Leavitt, David, 1961-

texts

#
eye 15

#
favorite 0

#
comment 0

319 pages : 23 cm

Topics: Turing, Alan, 1912-1954, Mathematicians -- Great Britain -- Biography, Computer scientists -- Great...

16
16

Jan 20, 2022
01/22

by
Dyson, George, 1953-

texts

#
eye 16

#
favorite 1

#
comment 0

xxii, 401 pages, 24 unnumbered pages of plates : 24 cm

Topics: Turing, Alan, 1912-1954, Turing machines, Computable functions, Random access memory, Computers --...

A model review is a validation technique aimed at determining if a model is of sufficient quality and allows defects to be identified early in the system development, reducing the cost of fixing them. In this paper we propose a technique to perform automatic review of Abstract State Machine (ASM) formal specifications. We first detect a family of typical vulnerabilities and defects a developer can introduce during the modeling activity using the ASMs and we express such faults as the violation...

Topics: NASA Technical Reports Server (NTRS), TEMPORAL LOGIC, MATHEMATICAL MODELS, PROGRAM VERIFICATION...

Parallel programming is still being based upon antiquated sequence-based definitions of the terms "algorithm" and "computation", resulting in programs which are architecture dependent and difficult to design and analyze. By focusing on obstacles inherent in existing practice, a more portable model is derived here, which is then formalized into a model called Soviets which utilizes a combination of imperative and functional styles. This formalization suggests more general...

Topics: NASA Technical Reports Server (NTRS), ALGORITHMS, PARALLEL PROGRAMMING, MATHEMATICAL MODELS,...

Bell System Technical Journal, 41: 3. May 1962 pp 877-884. On Non-Computable Functions. (Rado, T.)

Topics: turing, computable, entries, valid, score, entry, machine, binary, binary turing, functions, bell...

HiVy is a software tool set that enables verification through model checking of designs represented as finite-state machines or statecharts. HiVy provides automated translation of (1) statecharts created by use of the MathWorks Stateflow program to (2) Promela, the input language of the Spin model checker, which can then be used to verify, or trace logical errors in, distributed software systems. HiVy can operate directly on Stateflow models, or its abstract syntax of hierarchical sequential...

Topics: NASA Technical Reports Server (NTRS), AUTOMATA THEORY, SOFTWARE ENGINEERING, SEQUENTIAL CONTROL,...

1,268
1.3K

Dec 24, 2021
12/21

by
B. A. Trakhtenbrot

texts

#
eye 1,268

#
favorite 8

#
comment 0

This booklet, Algorithms and Automatic Computing Machines, gives some of the historical aspects of algorithms and goes on to outline the development of the theory of algorithms that has taken place in the twentieth century. In defining the term algorithm, the author considers the close relation between algorithms and computing machines. The reader will need no specific mathematical background beyond intermediate algebra, but he should be able to follow a rather complex train of logical thought....

Topics: computers, mathematics, algorithms, computer programmes, turing machines, games, word problems,...

From the bitsavers.org collection, a scanned-in computer-related document. mit :: lcs :: tm :: MIT-LCS-TM-045

Topics: multiplication, digits, turing, log, lemma, integer, multitape, algorithm, machine, turing machine,...

Computational Complexity A Modern Approach

Topics: theorem, algorithm, proof, random, function, polynomial, complexity, probability, prove, erm, lower...

From the bitsavers.org collection, a scanned-in computer-related document. mit :: ai :: aim :: AIM-031

Topics: functions, defined, function, recursive, computable, computation, conditional, canonical,...