---
title: "Decidable Problem — AP CSP Definition & Exam Guide"
description: "A decidable problem is a decision problem an algorithm can answer correctly for every input. Learn how AP CSP tests it against undecidable problems in 3.18."
canonical: "https://fiveable.me/ap-comp-sci-p/key-terms/decidable-problem"
type: "key-term"
subject: "AP Computer Science Principles"
---

# Decidable Problem — AP CSP Definition & Exam Guide

## Definition

A decidable problem is a computational problem for which there exists an algorithm that can determine whether a given input has a specific property or satisfies a certain condition.

## Related Study Guides

- [3.18 Undecidable Problems](/ap-comp-sci-p/unit-3/undecidable-problems/study-guide/q0SSR2ddayx397Hy6ztA)

## Review

### Related Terms

- [Undecidable Problem](/ap-comp-sci-p/key-terms/undecidable-problem): An undecidable problem is a computational problem for which no algorithm can determine whether a given input has a specific property or satisfies a certain condition.
- [Halting Problem](/ap-comp-sci-p/key-terms/halting-problem): The halting problem refers to the question of whether an arbitrary program will halt (terminate) or run forever when executed on some input.
- Turing Machine: A Turing machine is an abstract mathematical model used to simulate any computer algorithm. It consists of an infinite tape divided into cells, and the machine can read, write, and move along the tape based on its current state.