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)
  Models Of Computation (F.1.1) See Reviews  
Subject Descriptors:
Automata (267)
Bounded-Action Devices (78)
Computability Theory (54)
Relations Between Models (28)
Self-Modifying Machines (131)
Unbounded-Action Devices (122)
Proper Nouns:
There are no proper nouns with reviews under F.1.1.
Reviews limited to:

Reviews about "Models Of Computation (F.1.1)":
Languages with membership determined by single letter factors
Higgins P., Alwan S.  Theoretical Computer Science 680 15-24, 2017. Type: Article
The incomputable: journeys beyond the Turing barrier
Cooper S., Soskova M.,  Springer International Publishing, New York, NY, 2017. 292 pp. Type: Book (978-3-319436-67-8)
 Non-regular unary language and parallel communicating Watson-Crick automata systems
Chatterjee K., Ray K.  Theoretical Computer Science 705 113-117, 2018. Type: Article
Space-time computing with temporal neural networks
Smith J.,  Morgan & Claypool Publishers, San Rafael, CA, 2017. 242 pp. Type: Book (978-1-627059-48-0)
Link prediction in fuzzy social networks using distributed learning automata
Moradabadi B., Meybodi M.  Applied Intelligence 47(3): 837-849, 2017. Type: Article
The logical view on continuous Petri nets
Blondin M., Finkel A., Haase C., Haddad S.  ACM Transactions on Computational Logic 18(3): 1-28, 2017. Type: Article
Uniform continuity of relations and nondeterministic cellular automata
Furusawa H.  Theoretical Computer Science 673 19-29, 2017. Type: Article
Related Topics
F.1.1 Models Of Computation
  - Mathematical Logic
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy