HackerTrans
トップ新着トレンドコメント過去質問紹介求人

francoi8

no profile record

投稿

[untitled]

1 ポイント·投稿者 francoi8·先月·0 コメント

コメント

francoi8
·先月·議論
It should be fairly easy to mitigate no? Simply add random access times. Localstorage doesn't need to be that fast. More generally I find it very annoying how much browsers allow by default (javascript, localstorage, gpu access etc.) - there's only a very limited amount of websites I want to be able to run gpu accelerated shaders.
francoi8
·3 か月前·議論
For those wanting to explore automatically converting art pieces to 1-bit you can use 8Bit Photo Lab on iOS or Android. Select the black and white palette and choose resolution and dithering type.

Play Store: https://play.google.com/store/apps/details?id=com.ilixa.ebp&...

App Store: https://apps.apple.com/us/app/8bit-photo-lab/id6759910005
francoi8
·3 か月前·議論
All of these could have a set of standard non identifiable answers (eg. firefox reports the same 20 fonts, couple video formats, one among a few standard window sizes etc.) and for anything more extensive/precise, it would require the user's authorization and the user should have the option of feeding fake info (eg. fake timezone)
francoi8
·3 か月前·議論
One Lab is an Android/iOS app I develop that has quite a few generative algorithms (mostly pixel shaders). You can combine them with the various effects in the app to create your custom generative stack.

Link: https://onelab.ilixa.com/
francoi8
·3 か月前·議論
This blows my mind. What good reason is there for giving javascript such permissions by default? This should at the minimum trigger an explicit permission request from the user.
francoi8
·6 か月前·議論
There's nothing silly about those reasons.
francoi8
·11 か月前·議論
Busy Beaver is non computable and grows much faster than the various subcubic graph numbers (you could easily encode a subcubic graph number computation in a relatively small turing machine).
francoi8
·昨年·議論
I wonder if we can get a sense of how fast it would grow if we hypothesize it is an infinite sequence.

And if it is a finite sequence, one could define f(p, n) as the sequence of successive exponents of 2 such that the ratio of even digits over its total number of digits is greater than p. This could be an interesting way of describing a set of fast growing functions from exponential growth (p=0) to arbitrarily fast growth as p grows closer to 1 (or P where P is the smallest number such that f(P, n) is a finite sequence).
francoi8
·昨年·議論
I would say any large corporation should meet higher standards of public benefit.
francoi8
·2 年前·議論
I don't understand why the 4 corners of the screen make up the single hole. You could scroll the screen by 1 "square" which would change the corners which makes me feel there is nothing special about the original four corners.
francoi8
·2 年前·議論
These past 4 years, I've been working on One Lab https://play.google.com/store/apps/details?id=com.ilixa.onel...

It's a non destructive photo editor with a strong bend towards procedural generation.

Working on a video touch recording feature at the moment.