Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 39,00
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, Rice''s theorem states that, for any non-trivial property of partial functions, there is no general and effective method to decide whether an algorithm computes a partial function with that property. Here, a property of partial functions is called trivial if it holds for all partial computable functions or for none, and an effective decision method is called general if it decides correctly for every algorithm. The theorem is named after Henry Gordon Rice, and is also known as the Rice-Myhill-Shapiro theorem after Rice, John Myhill, and Norman Shapiro. 124 pp. Englisch.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 40,58
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, Rice''s theorem states that, for any non-trivial property of partial functions, there is no general and effective method to decide whether an algorithm computes a partial function with that property. Here, a property of partial functions is called trivial if it holds for all partial computable functions or for none, and an effective decision method is called general if it decides correctly for every algorithm. The theorem is named after Henry Gordon Rice, and is also known as the Rice-Myhill-Shapiro theorem after Rice, John Myhill, and Norman Shapiro.
Librería: preigu, Osnabrück, Alemania
EUR 125,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Rice's Theorem | Computability Theory, Partial Functions, Decision Problem, Algorithm, Partial Computable Function, Henry Gordon Rice | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131262418 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 156,00
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computabilitytheory, Rice's theorem states that, for any non-trivial property ofpartial functions, there is no general and effective method to decidewhether an algorithm computes a partial function with that property.Here, a property of partial functions is called trivial if it holds forall partial computable functions or for none, and an effective decisionmethod is called general if it decides correctly for every algorithm.The theorem is named after Henry Gordon Rice, and is also known as theRice-Myhill-Shapiro theorem after Rice, John Myhill, and Norman Shapiro.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 124 pp. Englisch.