211:
134:
113:
49:
22:
67:
500:
Showing all possible outputs in a lattice over n domains, calculating some distance or lines or hyper-planes is a measure, but it seems quite nonsensical and irrelevant, because the node traversal is not even shown in that lattice projection. In comparison, i can draw a 3d
Hilbert curve 2d projected,
508:
then is dumb enough to add some arbitrary bias to it, that has as much weight as "the apple on the right is clearly obviously objectively and arbitrarily axiomatically a worse fruit than the pea on the left" this test is also always biased in how it folds its domains, as different folding of domains
504:
The lowest example image shows 2 lattices, that are just rotated and stretched differently. They just appear different due to the modulo operator, but when you stack multiple of them in a tiling to undo that, they are the same lattices with a different ratio. the remaining argument is: "(closer to)
459:
The source I used for the description of how the test works is from a lecture at a university. The manual mentions nothing about citing lectures or presentations by professors, so I assume that they are okay, so long as they are accurate. That description also matches with my personal understanding
232:
532:
I recognize that the source I used for the bottom image may not be the best, and I would welcome a replacement if you have any. As for your opinion on the rest of the article, feel free to edit it to include your concerns about the test's effectiveness,
493:
I can see how a LCG that only returns odd values is 100% wasteful on the least significant bit. But this test seems to be more specific than being on that general LCG flaw on lower significant bits having a shorter period than higher significant bits.
509:
will result in different distances of hyper-planes. this is just as silly as favoring the folding of one hyperbolic
Hilbert curve over another, in blissful ignorance of arguing about bias and semantics, but not about content.
460:
of how the test works, which is the other reason I used it. Still, if somebody finds a different source on the same topic that may be more reliable, I would be grateful if you replaced mine with it.
256:
542:
Also, there's generally no need for that level of rudeness and vulgarity. Try to keep any issues you have with the subject of the article separate from those you have with the article itself.
537:
you can find a reputable source that backs them up. Keep in mind, though, that the test was vouched for by Knuth himself, which is a pretty high bar to overcome in terms of credibility.
396:
313:
251:
583:
184:
174:
501:
only in dots, and say "wow, that
Hilbert curve is just dots at projected cube corners". But I am not dumb enough to write that without satire, excluding Poe's law.
588:
578:
150:
358:
74:
54:
332:
573:
568:
197:
141:
118:
421:
512:
At least as this test is described here, in its basics, it is just dumb. There may be a "hidden gem in this pile of shit", but I doubt it.
304:
475:
285:
377:
342:
223:
79:
29:
352:
266:
505:
golden ratio lattice is likely a better lattice than (closer to) square lattice, if only for more even distribution"
387:
149:
related articles on
Knowledge. If you would like to participate, please visit the project page, where you can join
414:
549:
471:
323:
35:
463:
242:
545:
467:
294:
146:
519:
368:
210:
233:
Requested articles/Applied arts and sciences/Computer science, computing, and
Internet
562:
526:
515:
275:
133:
112:
66:
48:
497:
But failing to address that in a general form. And that makes it dumb.
553:
523:
479:
489:
I know this test is dumb enough to be noteworthy how dumb it is
351:
Find pictures for the biographies of computer scientists (see
15:
82:
process or it was formerly listed at
Requested articles.
145:, a collaborative effort to improve the coverage of
78:, because it is used for the administration of the
28:This article has not yet been rated on Knowledge's
257:Computer science articles needing expert attention
397:WikiProject Computer science/Unreferenced BLPs
8:
314:Computer science articles without infoboxes
252:Computer science articles needing attention
461:
218:Here are some tasks awaiting attention:
192:
107:
43:
21:
19:
584:Low-importance Computer science articles
88:Knowledge:WikiProject Requested articles
109:
91:Template:WikiProject Requested articles
45:
159:Knowledge:WikiProject Computer science
589:WikiProject Computer science articles
162:Template:WikiProject Computer science
7:
579:Unassessed Computer science articles
139:This article is within the scope of
72:This article is within the scope of
34:It is of interest to the following
333:Timeline of computing 2020–present
14:
359:Computing articles needing images
455:Source for 2nd and 3rd sentences
209:
132:
111:
65:
47:
20:
179:This article has been rated as
75:WikiProject Requested articles
1:
574:Requested articles by quality
569:Unassessed Requested articles
524:18:36, 3 September 2017 (UTC)
413:Tag all relevant articles in
153:and see a list of open tasks.
480:01:54, 2 December 2016 (UTC)
422:WikiProject Computer science
198:WikiProject Computer science
142:WikiProject Computer science
353:List of computer scientists
605:
185:project's importance scale
554:21:17, 15 July 2018 (UTC)
415:Category:Computer science
191:
178:
165:Computer science articles
127:
60:
42:
417:and sub-categories with
378:Computer science stubs
196:Things you can help
94:Requested articles
85:Requested articles
80:Requested articles
55:Requested articles
30:content assessment
482:
466:comment added by
452:
451:
448:
447:
444:
443:
440:
439:
436:
435:
106:
105:
102:
101:
596:
426:
420:
295:Computer science
224:Article requests
213:
206:
205:
193:
167:
166:
163:
160:
157:
156:Computer science
147:Computer science
136:
129:
128:
123:
119:Computer science
115:
108:
96:
95:
92:
89:
86:
69:
62:
61:
51:
44:
25:
24:
23:
16:
604:
603:
599:
598:
597:
595:
594:
593:
559:
558:
491:
457:
432:
429:
424:
418:
406:Project-related
401:
382:
363:
337:
318:
299:
280:
261:
237:
164:
161:
158:
155:
154:
121:
93:
90:
87:
84:
83:
12:
11:
5:
602:
600:
592:
591:
586:
581:
576:
571:
561:
560:
557:
556:
543:
539:
538:
490:
487:
485:
456:
453:
450:
449:
446:
445:
442:
441:
438:
437:
434:
433:
431:
430:
428:
427:
410:
402:
400:
399:
393:
383:
381:
380:
374:
364:
362:
361:
356:
348:
338:
336:
335:
329:
319:
317:
316:
310:
300:
298:
297:
291:
281:
279:
278:
272:
262:
260:
259:
254:
248:
238:
236:
235:
229:
217:
215:
214:
202:
201:
189:
188:
181:Low-importance
177:
171:
170:
168:
151:the discussion
137:
125:
124:
122:Low‑importance
116:
104:
103:
100:
99:
97:
70:
58:
57:
52:
40:
39:
33:
26:
13:
10:
9:
6:
4:
3:
2:
601:
590:
587:
585:
582:
580:
577:
575:
572:
570:
567:
566:
564:
555:
551:
547:
544:
541:
540:
536:
531:
530:
529:
528:
525:
521:
517:
513:
510:
506:
502:
498:
495:
488:
486:
483:
481:
477:
473:
469:
465:
454:
423:
416:
412:
411:
409:
407:
403:
398:
395:
394:
392:
390:
389:
384:
379:
376:
375:
373:
371:
370:
365:
360:
357:
354:
350:
349:
347:
345:
344:
339:
334:
331:
330:
328:
326:
325:
320:
315:
312:
311:
309:
307:
306:
301:
296:
293:
292:
290:
288:
287:
282:
277:
274:
273:
271:
269:
268:
263:
258:
255:
253:
250:
249:
247:
245:
244:
239:
234:
231:
230:
228:
226:
225:
220:
219:
216:
212:
208:
207:
204:
203:
199:
195:
194:
190:
186:
182:
176:
173:
172:
169:
152:
148:
144:
143:
138:
135:
131:
130:
126:
120:
117:
114:
110:
98:
81:
77:
76:
71:
68:
64:
63:
59:
56:
53:
50:
46:
41:
37:
31:
27:
18:
17:
534:
514:
511:
507:
503:
499:
496:
492:
484:
462:— Preceding
458:
405:
404:
388:Unreferenced
386:
385:
367:
366:
341:
340:
322:
321:
303:
302:
284:
283:
265:
264:
241:
240:
222:
221:
180:
140:
73:
36:WikiProjects
546:Skylord a52
468:Skylord a52
563:Categories
527:User:Ollj
276:Computing
476:contribs
464:unsigned
324:Maintain
267:Copyedit
305:Infobox
243:Cleanup
183:on the
286:Expand
32:scale.
369:Stubs
343:Photo
200:with:
550:talk
520:talk
516:Ollj
472:talk
175:Low
565::
552:)
535:if
522:)
478:)
474:•
425:}}
419:{{
548:(
518:(
470:(
408::
391::
372::
355:)
346::
327::
308::
289::
270::
246::
227::
187:.
38::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
