The following pages link to (Q4875855):
Displaying 11 items.
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons) (Q306278) (← links)
- Dynamic self-assembly in living systems as computation (Q862966) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- Real number computation through Gray code embedding. (Q1607300) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computabili (Q2631823) (← links)
- The Turing guide. Edited by Jack Copeland, Jonathan Bowen, Mark Sprevak and Robin Wilson (Q2827266) (← links)
- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization (Q2908546) (← links)