Reduction (Recursion Theory)

by Betascript Publishing
State: New
£23.28
VAT included - FREE Shipping
Betascript Publishing Reduction (Recursion Theory)
Betascript Publishing - Reduction (Recursion Theory)

Do you like this product? Spread the word!

£23.28 incl. VAT
Only 1 items available Only 1 items available
Delivery: between Tuesday, 7 June 2022 and Thursday, 9 June 2022
Sales & Shipping: Dodax

Description

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively convert a method for deciding membership in B into a method for deciding membership in A? If the answer to this question is affirmative then A is said to be reducible to B. The study of reducibility notions is motivated by the study of decision problems. For many notions of reducibility, if any noncomputable set is reducible to a set A then A must also be noncomputable. This gives a powerful technique for proving that many sets are noncomputable.

Further information

Language:
English
Number of Pages:
76
Editor:
Surhone, Lambert M.
Tennoe, Mariam T.
Henssonow, Susan F.
Media Type:
Softcover
Publisher:
Betascript Publishing

Master Data

Product Type:
Paperback book
Package Dimensions:
0.23 x 0.15 x 0.01 m; 0.127 kg
GTIN:
09786131309168
DUIN:
394BV4169ID
£23.28
We use cookies on our website to make our services more efficient and more user-friendly. Therefore please select "Accept cookies"! Please read our Privacy Policy for further information.