Search
for Topics
All Reviews
Browse All Reviews
>
Theory Of Computation (F)
>
Computation By Abstract Devices (F.1)
>
Models Of Computation (F.1.1)
> BoundedAction Devices (F.1.1...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 78 Reviews about "
BoundedAction Devices (F.1.1...)
":
Date Reviewed
Scalable zero knowledge via cycles of elliptic curves
BenSasson E., Chiesa A., Tromer E., Virza M. Algorithmica 79(4): 11021160, 2017. Type: Article
The construction of zkSNARKs, that is, zeroknowledge succinct noninteractive arguments of knowledge, is the subject of this paper. The reader should be aware that “succinct” is a relative term: the authors note that, in a particular...
Dec 18 2017
List decodability at small radii
Chee Y., Ge G., Ji L., Ling S., Yin J. Designs, Codes and Cryptography 61(2): 151166, 2011. Type: Article
In many cases, it is impossible for a decoding algorithm to specify a unique codeword closest to a received word; list decoding refers to the technique of producing a short list of possible codewords. The key concept is (
e
,͎...
Feb 2 2012
The annotated Turing: a guided tour through Alan Turing’s historic paper on computability and the Turing machine
Petzold C., Wiley Publishing, 2008. 384 pp. Type: Book (9780470229057), Reviews: (2 of 2)
This book is an attempt by Petzold to make Turing’s seminal paper, “On computable numbers, with an application to the Entscheidungsproblem” [1], accessible to ordinary readers; it has indeed turned out to be a successful attempt....
May 15 2009
The annotated Turing: a guided tour through Alan Turing’s historic paper on computability and the Turing machine
Petzold C., Wiley Publishing, 2008. 384 pp. Type: Book (9780470229057), Reviews: (1 of 2)
Computability theory textbooks usually have little historical content, while popular treatments usually have few technical details. This book is the exception that carefully explains one of the fundamental papers of the 20th century, putting it in...
Sep 18 2008
Modeling molecular computing systems by an artificial chemistryits expressive power and application
Tominaga K., Watanabe T., Kobayashi K., Nakamura M., Kishi K., Kazuno M. Artificial Life 13(3): 223247, 2007. Type: Article
After the AdlemanLipton [1] paradigm for DNA computation emerged, several methods to exploit the inherent largescale coding abilities of polynucleotide strands were proposed [2]. The onus was on each model’s proponents to demonstrate its ...
Jun 3 2008
One head machines from a symbolic approach
Gajardo A., Mazoyer J. Theoretical Computer Science 370(13): 3447, 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, their new ...
Jun 1 2007
NLprintable sets and nondeterministic Kolmogorov complexity
Allender E. Theoretical Computer Science 355(2): 127138, 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 1NL machine...
Sep 22 2006
Defining fairness
Völzer H., Varacca D., Kindler E. In
CONCUR 2005  Concurrency Theory: 16th International Conference, San Francisco, CA, August 2326, 2005. Proceedings (LNCS 3653)
. London, UK: SpringerVerlag, 2005. Type: Book Chapter
There is not a prevailing definition of fairness, but most definitions attempt to ensure that every transition of a system that is enabled sufficiently often is executed sufficiently often. The authors of this paper present a new definition, calle...
Jun 7 2006
Information, ethics, and computers: the problem of autonomous moral agents
Carsten Stahl B. Minds and Machines 14(1): 6783, 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 delivery. Specifi...
Jul 25 2005
Onedimensional quantum walks with absorbing boundaries
Bach E., Coppersmith S., Goldschen M., Joynt R., Watrous J. Journal of Computer and System Sciences 69(4): 562592, 2004. Type: Article
The analysis of a potential quantum computing device is a difficult subject to investigate, since it involves the study of computational methods from the theoretical viewpoint of quantum physics modeling. Such results provide a theoretical foundat...
Apr 20 2005
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright © 20002022 ThinkLoud, Inc.
Terms of Use

Privacy Policy