Full 1-bit adder using fluids Computer Science |
- Full 1-bit adder using fluids
- Feels appropriate
- System Design Twitter - Microservices Architecture Part I - Interview question at Facebook/Google
- 2019 in Review: 10 AI Papers That Made an Impact
- Computability and problem-solving: an introduction to problems. Just released the first essay in a series of essays dedicated to recursion theory, let me know what you think!
- Decimal and Four Byte Hex
- Its hard to make stateful code modular, but that could be fixed, if it could be optimized well enough, using lambdas.
| Posted: 31 Dec 2019 08:06 AM PST |
| Posted: 31 Dec 2019 10:47 PM PST 48 61 70 70 79 20 6e 65 77 20 79 65 61 72 20 63 6f 6d 70 75 74 65 72 20 73 63 69 65 6e 63 65 20 66 72 69 65 6e 64 73 21 20 0a [link] [comments]  |
| System Design Twitter - Microservices Architecture Part I - Interview question at Facebook/Google Posted: 31 Dec 2019 06:28 PM PST Hello friends, In this video I am discussing system design of Twitter using micro-services architecture. The design of Twitter involve around different distributed system concepts like distributed microservices, distributed cache and distributed datastore. Let me know if you find it useful. https://www.youtube.com/watch?v=1_HIpTBUHAs&utm_source=reddit Thanks. [link] [comments]  |
| 2019 in Review: 10 AI Papers That Made an Impact Posted: 31 Dec 2019 09:45 AM PST |
| Posted: 31 Dec 2019 08:56 AM PST |
| Posted: 31 Dec 2019 12:10 PM PST Well, hello everyone! I am needing to know how to change a four byte hex number to decimal, and a decimal to a four byte hex. I am writing some code to change the size of a bitmap. The data for a bitmap is hexadecimal. I spent a great deal of time worrying about scaling images for different displays, and I need to get some more experience too. Thanks, Josh [link] [comments]  |
| Posted: 31 Dec 2019 02:36 PM PST Lambdas are naturally modular, cuz if x can reach y (through pointers) then y cant reach x. A lambda can still get a pointer "to itself" in its parameter, but what can reach "itself" is not the self but the code which called x on for example (pair x z). I'm experimenting with a certain universal lambda function, which is very optimizable but its most natural form is a trinary forest of call pairs each with the option of a "comment" (the third branch) which can be any lambda, and all paths in the trinary forest lead to the universal lambda. https://github.com/benrayfield/occamsfuncer V2. Making practical programs only as combos of a universal lambda function is very hard. Even to add 2 doubles requires deriving the ieee754 spec from bits, and deriving bit ops from lambdas, then using a kind of emulation hook to use the hardware double ops, and other optimizations. This power comes at a high cost of efficiency, but I'm trying to port my Audivolv musical instrument evolver software to the universal lambda as a proof of concept eventually, as the lambdas would generate a forest of (double,double)->double ops which would run all at once as an optimization, and replace that with a different forest of (double,double)->double ops maybe 100 times per second to change the interactive sound effects. This would be computable, the exact same bits, as pure lambdas or with optimizations. I'm making a kind of JIT compiler for it. [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment