# What Can Be Computed?: A Practical Guide to the Theory of Computation

@inproceedings{MacCormick2018WhatCB, title={What Can Be Computed?: A Practical Guide to the Theory of Computation}, author={John MacCormick}, year={2018} }

A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple 354 • 17 Karp’s 21 problems encodings from such domains into the set of words over a finite alphabet these problems can be converted into language recognition problems, and we can inquire into their computational complexity. It is reasonable to consider such a… CONTINUE READING

#### Citations

##### Publications citing this paper.

## Strategies for Basing the CS Theory Course on Non-decision Problems

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 23 REFERENCES