- The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.
The result was redirect to Random number generation. Discussion about a different redirect target can occur on article talk page. Liz Read! Talk! 05:36, 8 June 2022 (UTC)[reply]
- Randomization function (edit | talk | history | protect | delete | links | watch | logs | views) – (View log | edits since nomination)
- (Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)
- Article on an ill-defined concept, that lacks references. Reasons for deletion:
- Article has no references and has been marked as Unreferenced since 2009. I was not able to find any references for this concept. It seems that the term 'randomization function' is not used systematically in literature.
- The article does not clarify what a 'Randomized function' actually is. If fails to explain how the concept is different from a hash function, a pseudorandom function family or a random permutation The articles states that while 'Randomization functions' are related to hash functions, their uses and requirements are different, but it does not elaborate on this.
- The example about quicksort is actually a nice illustration of the use of randomized algorithms. However, this is explained better at Randomized algorithm and Quicksort
- Only two pages link to this article (Hash function and Checksum). Plusminusone (talk) 20:16, 24 May 2022 (UTC)[reply]
- Note: This discussion has been included in the list of Computing-related deletion discussions. Shellwood (talk) 22:20, 24 May 2022 (UTC)[reply]
- Redirect to either Random number generation or specifically to Random number generation#Computational methods. PianoDan (talk) 16:46, 25 May 2022 (UTC)[reply]
- Comment I think there is a real topic here, as in the field of randomized algorithms, how one goes about randomizing the problems matters--uniform vs nonuniform distributions, is it possible to derandomize an algorithm, etc. But I don't know that the randomizing process in that field is canonically called a "Randomization function". If it is a neologism, then the article should probably be deleted. But if this is standard terminology (my knowledge of the field stops at Motwani and Raghavan), then a redirect to Randomized_algorithm#Motivation which briefly mentions such functions, may be warranted. --
((u|Mark viking)) {Talk} 20:48, 25 May 2022 (UTC)[reply]
- I can see how this article could make sense if it defined a randomization function to be 'a randomized algorithm that maps a problem instance to another equivalent problem instance' or something along that line. However, as far as I know 'Randomization function' is not standard terminology in the field of randomized algorithms. At least, I have not been able to find any references where the term is use like this. Plusminusone (talk) 19:16, 26 May 2022 (UTC)[reply]
Relisted to generate a more thorough discussion and clearer consensus.
Please add new comments below this notice. Thanks, Less Unless (talk) 13:49, 1 June 2022 (UTC)[reply]
- The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.