Recursive Languages and Sets: Computability Theory, Algorithm, Decision Problem, String, Alphabet, Halting Problem, Computable Function, Indicator ... Number, Pairing Function, Empty Set, Image - Couverture souple

 
9786130347420: Recursive Languages and Sets: Computability Theory, Algorithm, Decision Problem, String, Alphabet, Halting Problem, Computable Function, Indicator ... Number, Pairing Function, Empty Set, Image
Couverture souple
ISBN 10 : 6130347421 ISBN 13 : 9786130347420
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6130347421
ISBN 13 
9786130347420
Reliure
Broché
Nombre de pages
180
Éditeur
Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible