Brainscape
Find Flashcards
Make Flashcards
Why It Works
More
Educators
Businesses
Tutors & resellers
Content partnerships
Academy
About
Educators
Teachers & professors
Content partnerships
Tutors & resellers
Businesses
Employee training
Content partnerships
Tutors & resellers
Academy
About
Log In
Get Started
Brainscape's Knowledge Genome
TM
Browse over 1 million classes created by top students, professors, publishers, and experts.
Entrance Exams
Professional Certifications
Foreign Languages
Medical & Nursing
Science
English
Humanities & Social Studies
Mathematics
Law
Vocations
Health & Fitness
Business & Finance
Technology & Engineering
Food & Beverage
Fine Arts
Random Knowledge
See full index
Role Goals
> Computational Theory > Flashcards
Computational Theory Flashcards
Automata theory, Turing completeness, and P vs NP problem—concepts that shape the limits of what computers can solve.
Study These Flashcards
Role Goals
(13 decks)
System Design
Database Design & Scaling
Caching Layers:
Event Driven Architecture
SOLID
Algorithms
Dynamic Problem Approaches
Design Patterns
Concurrency and Parallelism
Networking and Distributed Systems
Operating Systems
Computational Theory
Security Basics
