Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Recursive Languages and Sets
CHF 61.55
Auf Lager
SKU
ONQ5VB9QC39
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
High Quality Content by WIKIPEDIA articles! In computability theory, a set is decidable, computable, or recursive if there is an algorithm that terminates after a finite amount of time and correctly decides whether or not a given object belongs to the set. Decidability of a set is of particular interest when the set is viewed as a decision problem; a decidable set is also a decidable problem, computable problem, and recursive problem. The remainder of this article uses the term decidable, although recursive and computable are equivalent in this context. A language is a set of finite strings over a particular alphabet. A language is decidable (also computable, recursive) if it is a decidable set. A set, language, or decision problem that is not decidable is undecidable, non-recursive, non-computable, or uncomputable. There are many known undecidable sets; one of the earliest, and most famous, examples is the halting problem.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786130345938
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T10mm
- Jahr 2010
- EAN 9786130345938
- Format Kartonierter Einband
- ISBN 978-613-0-34593-8
- Titel Recursive Languages and Sets
- Untertitel Instruction, Computational Problem, Mathematics, Numerology, Pure Mathematics, Human-Computer Interaction, Programming Language, Operating System
- Gewicht 261g
- Herausgeber Betascript Publishers
- Anzahl Seiten 164
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
