|
|
Sold Out
Book Categories |
| Algorithmic randomness, quantum physics, and incompleteness | 1 | |
| On the complexity of universal programs | 18 | |
| Finite sets of words and computing | 36 | |
| Universality and cellular automata | 50 | |
| Leaf language classes | 60 | |
| Computational completeness of P systems with active membranes and two polarizations | 82 | |
| Computing with a distributed reaction-diffusion model | 93 | |
| Computational universality in symbolic dynamical systems | 104 | |
| Real recursive functions and real extensions of recursive functions | 116 | |
| Ordering and convex polyominoes | 128 | |
| Subshifts behavior of cellular automata : topological properties and related languages | 140 | |
| Evolution and observation : a non-standard way to accept formal languages | 153 | |
| The computational power of continuous dynamic systems | 164 | |
| Abstract geometrical computation for black hole computation | 176 | |
| Is Bosco's rule universal? | 188 | |
| Sequential P systems with unit rules and energy assigned to membranes | 200 | |
| Hierarchies of DLOGTIME-uniform circuits | 211 | |
| Several new generalized linear- and optimum-time synchronization algorithms for two-dimensional rectangular arrays | 223 | |
| Register complexity of LOOP-, WHILE-, and GOTO-programs | 233 | |
| Classification and universality of reversible logic elements with one-bit memory | 245 | |
| Universal families of reversible P systems | 257 | |
| Solving 3CNF-SAT and HPP in linear time using WWW | 269 | |
| Completing a code in a regular submonoid of the free monoid | 281 | |
| On computational universality in language equations | 292 | |
| Attacking the common algorithmic problem by recognizer P systems | 304 | |
| On the minimal automaton of the shuffle of words and araucarias | 316 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Carole Keel
reviewed Machines, Computations, and Universality on October 13, 2014
Machines, Computations, and Universality
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Machines, Computations, and Universality
X
This Item is in Your Inventory
Machines, Computations, and Universality
X
You must be logged in to review the productsX
X
X
Add Machines, Computations, and Universality, This book constitutes the refereed proceedings of the Third International Conference on Machines, Computations, and Universality, MCU 2001, held in Chisinau, Moldavia, in May 2001. The book presents nine invited papers together with 13 revised referee, Machines, Computations, and Universality to the inventory that you are selling on WonderClubX
X
Add Machines, Computations, and Universality, This book constitutes the refereed proceedings of the Third International Conference on Machines, Computations, and Universality, MCU 2001, held in Chisinau, Moldavia, in May 2001. The book presents nine invited papers together with 13 revised referee, Machines, Computations, and Universality to your collection on WonderClub |
