Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Theory Of Computation (F) > Computation By Abstract Devices (F.1) > Models Of Computation (F.1.1) > Bounded-Action Devices (F.1.1...)  
  1-10 of 23 Reviews about "Bounded-Action Devices (F.1.1...)": Date Reviewed
  One head machines from a symbolic approach
Gajardo A., Mazoyer J. Theoretical Computer Science 370(1-3): 34-47, 2007.  Type: Article

This paper proposes a new computing machine model, a modified Turing machine, and studies properties of the proposed model. The major modification the authors propose is to allow for a tape in the form of a Cayley graph. In other words...

Jun 1 2007
  NL-printable sets and nondeterministic Kolmogorov complexity
Allender E. Theoretical Computer Science 355(2): 127-138, 2006.  Type: Article

The study of printability (namely, polynomial time (P) printability) was introduced by Hartmanis and Yesha [1]. Jenner and Kirsig [2] proved that every nondeterministic logspace (NL) printable set is a sparse set that is accepted by a ...

Sep 22 2006
  Information, ethics, and computers: the problem of autonomous moral agents
Carsten Stahl B. Minds and Machines 14(1): 67-83, 2004.  Type: Article

Are computers able to use information to act morally and reflect ethically? This is the question Stahl seeks to address in this paper. It is cleverly structured and well conceived, but falls somewhat short of its potential in the deliv...

Jul 25 2005
  The modal argument for hypercomputing minds
Bringsjord S., Arkoudas K. Theoretical Computer Science 317(1-3): 167-190, 2004.  Type: Article

The goal of this paper is to deny computationalism, defined as the statement that “persons are (physically realized) Turing machines.” It is not clear what “physically realized” is supposed to me...

Apr 19 2005
  Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Wiedermann J. Theoretical Computer Science 317(1-3): 61-69, 2004.  Type: Article

From the author’s abstract:...

Apr 18 2005
  The concept of computability
Cleland C. Theoretical Computer Science 317(1-3): 209-225, 2004.  Type: Article, Reviews: (2 of 2)

This is a critique of certain aspects of the thesis (often referred to as the Church-Turing thesis) that effectively computable coincides with Turing machine computable. The author’s main arguments are: (1) Turing machine com...

Sep 22 2004
  The concept of computability
Cleland C. Theoretical Computer Science 317(1-3): 209-225, 2004.  Type: Article, Reviews: (1 of 2)

The long-standing issue of the formalist account of computability, as it is presented by Turing machines, is discussed in this paper. It provides good background information on the early work of Hilbert and Cantor, which is required kn...

Sep 15 2004
  Super-tasks, accelerating Turing machines and uncomputability
Shagrir O. Theoretical Computer Science 317(1-3): 105-114, 2004.  Type: Article

An accelerating Turing machine is a Turing machine (TM) that is capable of carrying out a “super-task,” that is, an infinite number of steps in a finite amount of time, for instance by using one minute for the first...

Sep 14 2004
  Parallel Turing machines with one-head control units and cellular automata
Worsch T. Theoretical Computer Science 217(1): 3-30, 1999.  Type: Article

One-dimensional cellular automata can be easily simulated using atype of parallel Turing machine (PTM) in which each tape cell used in acomputation may be scanned by zero or more independent control units (orprocessors) having a single...

Jun 1 1999
  Quantum complexity theory
Bernstein E., Vazirani U. SIAM Journal on Computing 26(5): 1411-1473, 1997.  Type: Article

The authors define a quantum Turing machine (QTM) analogously to the classic Turing machine as a triplet ( &Sgr; , Q , &dgr; ), where &Sgr; is a finite alphabet with an identified blank symbol #,
Mar 1 1999
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy