This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - AngelFish
Pages: 1 ... 54 55 [56] 57 58 ... 215
826
« on: June 06, 2011, 05:48:45 pm »
There are lots of things I've been trying to improve with the wiki recently, but it's just too slow for doing anything useful. What should take a few minutes can take up to hours since pages load so incredibly slowly. Is there anything we can do to make it faster?
Change the host  I'm not sure I can restore the backups to a new host, though.
827
« on: June 06, 2011, 12:21:03 am »
Looks awesome. One request, though: Don't bring over the ROL tradition of making calc games larger than the calcs memory too  Looks like we better get Flash writing figured out so you can create save files where they're supposed to be in memory.
828
« on: June 05, 2011, 08:19:56 pm »
...C has full access over lower level parts of the OS and the hardware itself...
Technical Correction: C has partial access to the lower level parts of the OS and the hardware itself. Some things just can't be done without dipping into inline ASM. C does a heck of the lot, though, to be fair.
829
« on: June 05, 2011, 03:04:31 pm »
I don't mean to prolong the beating of this horse, but I just want to throw in this analogy:
Look at modern computers. Interpreters are bloody fast nowadays, with advanced JIT compilation and other optimization techniques. In some specialized cases, they can even beat compiled code for speed. They're also not limited in their functions, since pretty much anything that can be written in a compiled language can also be done in an interpreted one. However, people still use compiled code for many things. You're not going to write Crysis in Java (Minecraft is already pushing the limits). Some programs are simply too advanced for interpreters and also, sandboxing means that anything that has to interface with the OS in ways that weren't intended has to be compiled or assembled.
830
« on: June 05, 2011, 04:42:23 am »
I'm not sure, that manages to fit into RAM. Some of DJ's programs are so big that they literally can't fit into the 24000 bytes of RAM
831
« on: June 04, 2011, 11:16:48 pm »
My outdated Chrome did allow an exploit in that test, but only after it gave me the option to allow or deny. That's good enough for me and I know my up to date FF would pass.
833
« on: June 04, 2011, 09:00:25 pm »
It depends. The preloaded calculator that came on my Windows 7 comp is excellent
834
« on: June 04, 2011, 06:54:49 pm »
My first TI-BASIC program: A mathematical simulation of Brownian motion/Random walk. Horribly coded. My first Axe program: A 1-D cellular automata generator. Very slow, because I updated the screen after Every. Single. Pixel. My first Prizm Program: A program to test overclocking. It almost bricked z80man's Prizm
835
« on: June 04, 2011, 12:52:49 pm »
I had a nice program to generate one, but I think it was deleted in an actual RAM clear  EDIT: Found the source. Here you go
836
« on: June 04, 2011, 12:51:40 am »
It does sound like a file system bug. How much memory are you using? It may crash while trying to allocate the physical memory for the file.
837
« on: June 01, 2011, 10:08:13 pm »
That strikes me as kind of an object oriented/functional markup language more than a programming language for some reason.
One question I have is why "Give <n>" rather than the standard "Return"?
838
« on: May 30, 2011, 06:27:32 pm »
Okay, rewrote a few things to make the threading a lot more efficient, at the cost of some size. Still not entirely sure how I'm going to handle the library calls, though. I also implemented more of the instruction sets for the Lua and Java VMs. EDIT: Also implemented the full Brainf*ck instruction set
839
« on: May 30, 2011, 03:37:52 pm »
If you're confused about pointers, remember that every piece of memory (called a byte) is assigned an address in hexadecimal by the processor, starting from 0x0000. A pointer is just the address of a particular memory location, meaning that it's a 16 bit number that identifies one byte in memory. They're called pointers because the numbers "point" to that address. Since pointers are numbers, you can do the normal mathematical operations on them like addition and subtraction to change them.
Take this Axe code as an example:
[0123456789ABCDEF00]->Str1 .The contents of Str1 are placed somewhere in the program by Axe and the symbol Str1 becomes a pointer to the memory holding the first value Text(40,40,Str1>char .Since characters are hexadecimal, we can print the string .The pointer that is Str1 tells the text( directive to print the string starting from the address pointed to by Str1 Text(40,40,Str1+4>char .We can also print only part of the string by adding 4 to the pointer. This means that that value Str1+4 points to the location four bytes after the location pointed to by Str1, which is partway through the string.
840
« on: May 30, 2011, 12:00:20 am »
Sorry if I double post or repeat what someone's said earlier.
Anyway, while I don't doubt that it exists, I doubt that it's production ready or general purpose. I would be highly surprised if it could outperform even a half decent server. Quantum computers, to be honest, currently suck. You'd probably be better off trying to use a small server farm for the money than a single quantum computer.
Pages: 1 ... 54 55 [56] 57 58 ... 215
|