Skip to Content
Theory of Computation
book

Theory of Computation

by George Tourlakis
April 2012
Intermediate to advanced
416 pages
10h 40m
English
Wiley
Content preview from Theory of Computation

CHAPTER 5

COMPUTATIONAL COMPLEXITY

What do we mean by saying “this problem, xA, has no algorithmic solution”? And why is it that some problems do not have such solutions? How can we classify (compare) such undecidable problems? These are the fundamental questions of computability theory that we studied in Chapter 2.

Among the problems xA that do have algorithmic solutions (decidable or solvable problems), why is it that some require enormous computational resources toward obtaining the answer? And how can we classify decidable problems according to their demand on computational resources? This is the domain of computational complexity, or just complexity, theory. This chapter discusses a few topics in complexity theory.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Understanding Computation

Understanding Computation

Tom Stuart

Publisher Resources

ISBN: 9781118014783Purchase book