Back مجموعة قابلة للحساب Arabic Conjunt recursiu Catalan Татсапаруллă йыш CV Entscheidbarkeit German Αναδρομικό σύνολο Greek Komputebla aro Esperanto Conjunto recursivo Spanish مجموعه بازگشتی Persian Ensemble récursif French קבוצה רקורסיבית HE
In computability theory, a set of natural numbers is computable (or decidable or recursive) if there is an algorithm that computes the membership of every natural number in a finite number of steps. A set is noncomputable (or undecidable) if it is not computable.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search