"...unified memory means the CPU and GPU get equal access to textures & vertex data..."
This is where AGP comes in it was originally designed so the GPU can access system RAM I don't know how hard it would be it implement due to no one using AGP this way and as for running in kernel mode I know enough to BS about how to get around that...
"specialised controllers"
They are USB but w/ a different connector and I'm sure someone could figure out how to use a CompUSA USB controller and remap the buttons or rewire the connector to a USB connector... I'm not saying I know how to do this but theirs a lot of people out their and I haven't seen anything talking about running xbox games on a regular win2k box or something similar
but its running a 733 Mhz IIRC p3 and 64 megs of ram(Unified Memory Architecture) my home computer 1200 Mhz and 512 megs of ram and 64 meg radion i think that it wouldnt be a problem of hardware for most home users
I was wondering what OS the xbox is based off of the games use directx 8 and such so should it be a fairly easy thing to get the game to run on a win32 box?
Didn't Nikola Tesla do something like this? I rember reading about a lamp that had no cords that the power went thru the air some sorta wireless that was safe. I dunno I don't rember much about Tesla except the really cool pics
It comes up when you do a search it show relevant items in the directory and you know what I will take my info any way I can if it is the right stuff I don't not use something that can give me what im looking for cause of my biases. I use win2k pro cause its good for administration of win2k servers which exist in the real world and you know what else I have hummingbird and telnet and ssh for the Linux boxes the right tool for the job if yahoo's pre packaged stuff will work and google come up with nothing than that's -1 for google
If it help i work at a co. that has 53 international offices and deal with UUnet/worldcom/alternet/ etc.. All the same (company) but they have horrible service it will cut out where if i dial in to netzero i can ping our office in Mexico or uk or wherever but with the UUNet connection (on both ends not leaving their network) i can't it sucks but that the internet (yes for those that will flame we are looking for alternatives but its not a quick switch)
ok i had to look it up a smiple search on google dont think that this as a troll just trying to help those that dont use google
http://www.utm.edu/research/primes/mersenne.shtm l:
"Many early writers felt that the numbers of the form 2n-1 were prime for all primes n, but in 1536 Hudalricus Regius showed that 211-1 = 2047 was not prime (it is 23.89). By 1603 Pietro Cataldi had correctly verified that 217-1 and 219-1 were both prime, but then incorrectly stated 2n-1 was also prime for 23, 29, 31 and 37. In 1640 Fermat showed Cataldi was wrong about 23 and 37; then Euler in 1738 showed Cataldi was also wrong about 29. Sometime later Euler showed Cataldi's assertion about 31 was correct.
Enter French monk Marin Mersenne (1588-1648). Mersenne stated in the preface to his Cogitata Physica-Mathematica (1644) that the numbers 2n-1 were prime for
n = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127 and 257
and were composite for all other positive integers n 257. Mersenne's (incorrect) conjecture fared only slightly better than Regius', but still got his name attached to these numbers.
Definition: When 2n-1 is prime it is said to be a Mersenne prime.
It was obvious to Mersenne's peers that he could not have tested all of these numbers (in fact he admitted as much), but they could not test them either. It was not until over 100 years later, in 1750, that Euler verified the next number on Mersenne's and Regius' lists, 231-1, was prime. After another century, in 1876, Lucas verified 2127-1 was also prime. Seven years later Pervouchine showed 261-1 was prime, so Mersenne had missed this one. In the early 1900's Powers showed that Mersenne had also missed the primes 289-1 and 2107-1. Finally, by 1947 Mersenne's range, n 258, had been completely checked and it was determined that the correct list is:
n = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107 and 127.
Many ancient cultures were concerned with the relationship of a number with the sum of its divisors, often giving mystic interpretations. Here we are concerned only with one such relationship:
Definition: A positive integer n is called a perfect number if it is equal to the sum of all of its positive divisors, excluding n itself.
For example, 6 is the first perfect number because 6=1+2+3. The next is 28=1+2+4+7+14. The next two are 496 and 8128. These four were all known before the time of Christ. Look at these numbers in the following partially factored form:
2.3, 4.7, 16.31, 64.127.
Do you notice they all have the same form 2n-1(2n-1) (for n = 2, 3, 5, and 7 respectively)? And that in each case 2n-1 was a Mersenne prime? In fact it is easy to show the following theorems:
Theorem One: k is an even perfect number if and only if it has the form 2n-1(2n-1) and 2n-1 is prime. [Proof.]
Theorem Two: If 2n-1 is prime, then so is n. [Proof.]
So the search for Mersennes is also the search for even perfect numbers!
You may have also noticed that the perfect numbers listed above (6, 28, 496, 8128) all end with either the digit 6 or the digit 8--this is also very easy to prove (but no, they do not continue to alternate 6, 8, 6, 8,...). If you like that digit pattern, look at the first four perfect numbers in binary:
110
11100
111110000
1111111000000
(The binary digit pattern is a consequence of Theorem One.) It is not known whether or not there is an odd perfect number, but if there is one it is big! This is probably the oldest unsolved problem in all of mathematics.
When checking to see if a Mersenne number is prime, we usually first look for any small divisors. The following theorem of Euler and Fermat is very useful in this regard.
Theorem Three: Let p and q be primes. If q divides Mp = 2p-1, then
q = +/-1 (mod 8) and q = 2kp + 1
for some integer k. [Proof.]
Finally, we offer the following for your perusal:
Theorem Four. Let p = 3 (mod 4) be prime. 2p+1 is also prime if and only if 2p+1 divides Mp. [Proof].
Theorem Five. If you sum the digits of any even perfect number (except 6), then sum the digits of the resulting number, and repeat this process until you get a single digit, that digit will be one "
Re:Wasn't this posted a while ago?
on
Clockless Chips
·
· Score: 1
I don't know about you but I type a lot of things that are not in the dictionary what about commands? ls is not a word would is use its AI to think you typed is or something else??? It can't fly if all it uses AI cause people type things it not going to recognize
This is not meant as a troll but it is a smart-ass question that I would like to know the answer to... in the article it says "The cache is made up of solid-state memory, meaning that it has no mechanical or moving parts" is their cache that has moving parts? Or is this just more of a... 'hey this is in our product isn't it cool....' To impress the average Joe???
Slashdot Mirror
"...unified memory means the CPU and GPU get equal access to textures & vertex data..."
This is where AGP comes in it was originally designed so the GPU can access system RAM I don't know how hard it would be it implement due to no one using AGP this way and as for running in kernel mode I know enough to BS about how to get around that...
"specialised controllers"
They are USB but w/ a different connector and I'm sure someone could figure out how to use a CompUSA USB controller and remap the buttons or rewire the connector to a USB connector... I'm not saying I know how to do this but theirs a lot of people out their and I haven't seen anything talking about running xbox games on a regular win2k box or something similar
but its running a 733 Mhz IIRC p3 and 64 megs of ram(Unified Memory Architecture) my home computer 1200 Mhz and 512 megs of ram and 64 meg radion i think that it wouldnt be a problem of hardware for most home users
whoa their cowboy built-in video card and Unified Memory Architecture are way very different things
actually they sell them at a loss.. you do the math
I was wondering what OS the xbox is based off of the games use directx 8 and such so should it be a fairly easy thing to get the game to run on a win32 box?
GTK2 is comming out for *nix it will be a long while before its out on win32 or OS X
not true I was a band dork and played the xylophone and I was a computer geek
4. Dual-Head Matrox g550s = 8 places to stick a monitor
9. Monitors
go figure
I work 80 hrs weeks every now and then and I love every min of it.
umm id love to find a job involving networking and not working weekends or night umm its part of the job
i was looking for Shakespeare references
Didn't Nikola Tesla do something like this? I rember reading about a lamp that had no cords that the power went thru the air some sorta wireless that was safe. I dunno I don't rember much about Tesla except the really cool pics
It comes up when you do a search it show relevant items in the directory and you know what I will take my info any way I can if it is the right stuff I don't not use something that can give me what im looking for cause of my biases. I use win2k pro cause its good for administration of win2k servers which exist in the real world and you know what else I have hummingbird and telnet and ssh for the Linux boxes the right tool for the job if yahoo's pre packaged stuff will work and google come up with nothing than that's -1 for google
so you have a internet connection of 11 mbps or more ??? wow i wish my network was the limiting factor while surfing the web
reminds me of a TI-82 program
If it help i work at a co. that has 53 international offices and deal with UUnet/worldcom/alternet/ etc.. All the same (company) but they have horrible service it will cut out where if i dial in to netzero i can ping our office in Mexico or uk or wherever but with the UUNet connection (on both ends not leaving their network) i can't it sucks but that the internet (yes for those that will flame we are looking for alternatives but its not a quick switch)
ummm look for anything w/ a *htm * html *asp *jsp or *php yadda yadda yadda
did ya actually look at the page? at the top is Category: Arts > Literature > World Literature > British > Shakespeare > Works
ok i had to look it up a smiple search on google dont think that this as a troll just trying to help those that dont use googlem l:
http://www.utm.edu/research/primes/mersenne.sht
"Many early writers felt that the numbers of the form 2n-1 were prime for all primes n, but in 1536 Hudalricus Regius showed that 211-1 = 2047 was not prime (it is 23.89). By 1603 Pietro Cataldi had correctly verified that 217-1 and 219-1 were both prime, but then incorrectly stated 2n-1 was also prime for 23, 29, 31 and 37. In 1640 Fermat showed Cataldi was wrong about 23 and 37; then Euler in 1738 showed Cataldi was also wrong about 29. Sometime later Euler showed Cataldi's assertion about 31 was correct.
Enter French monk Marin Mersenne (1588-1648). Mersenne stated in the preface to his Cogitata Physica-Mathematica (1644) that the numbers 2n-1 were prime for
n = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127 and 257
and were composite for all other positive integers n 257. Mersenne's (incorrect) conjecture fared only slightly better than Regius', but still got his name attached to these numbers.
Definition: When 2n-1 is prime it is said to be a Mersenne prime.
It was obvious to Mersenne's peers that he could not have tested all of these numbers (in fact he admitted as much), but they could not test them either. It was not until over 100 years later, in 1750, that Euler verified the next number on Mersenne's and Regius' lists, 231-1, was prime. After another century, in 1876, Lucas verified 2127-1 was also prime. Seven years later Pervouchine showed 261-1 was prime, so Mersenne had missed this one. In the early 1900's Powers showed that Mersenne had also missed the primes 289-1 and 2107-1. Finally, by 1947 Mersenne's range, n 258, had been completely checked and it was determined that the correct list is:
n = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107 and 127.
Many ancient cultures were concerned with the relationship of a number with the sum of its divisors, often giving mystic interpretations. Here we are concerned only with one such relationship:
Definition: A positive integer n is called a perfect number if it is equal to the sum of all of its positive divisors, excluding n itself.
For example, 6 is the first perfect number because 6=1+2+3. The next is 28=1+2+4+7+14. The next two are 496 and 8128. These four were all known before the time of Christ. Look at these numbers in the following partially factored form:
2.3, 4.7, 16.31, 64.127.
Do you notice they all have the same form 2n-1(2n-1) (for n = 2, 3, 5, and 7 respectively)? And that in each case 2n-1 was a Mersenne prime? In fact it is easy to show the following theorems:
Theorem One: k is an even perfect number if and only if it has the form 2n-1(2n-1) and 2n-1 is prime. [Proof.]
Theorem Two: If 2n-1 is prime, then so is n. [Proof.]
So the search for Mersennes is also the search for even perfect numbers!
You may have also noticed that the perfect numbers listed above (6, 28, 496, 8128) all end with either the digit 6 or the digit 8--this is also very easy to prove (but no, they do not continue to alternate 6, 8, 6, 8,...). If you like that digit pattern, look at the first four perfect numbers in binary:
110
11100
111110000
1111111000000
(The binary digit pattern is a consequence of Theorem One.) It is not known whether or not there is an odd perfect number, but if there is one it is big! This is probably the oldest unsolved problem in all of mathematics.
When checking to see if a Mersenne number is prime, we usually first look for any small divisors. The following theorem of Euler and Fermat is very useful in this regard.
Theorem Three: Let p and q be primes. If q divides Mp = 2p-1, then
q = +/-1 (mod 8) and q = 2kp + 1
for some integer k. [Proof.]
Finally, we offer the following for your perusal:
Theorem Four. Let p = 3 (mod 4) be prime. 2p+1 is also prime if and only if 2p+1 divides Mp. [Proof].
Theorem Five. If you sum the digits of any even perfect number (except 6), then sum the digits of the resulting number, and repeat this process until you get a single digit, that digit will be one "
they both reference the same article http://www.techreview.com/magazine/oct01/tristrama ll.asp
this has been posted http://slashdot.org/article.pl?sid=01/09/15/133235 &mode=thread before even reference the same freekin article good job
I don't know about you but I type a lot of things that are not in the dictionary what about commands? ls is not a word would is use its AI to think you typed is or something else??? It can't fly if all it uses AI cause people type things it not going to recognize
how does nuclear power work in to this???? i really do want to know incase i missed something but i dont see the connection
why the hell would they optmise a compiler for a processor only to use that compiler on a different processor?
This is not meant as a troll but it is a smart-ass question that I would like to know the answer to... in the article it says "The cache is made up of solid-state memory, meaning that it has no mechanical or moving parts" is their cache that has moving parts? Or is this just more of a ... 'hey this is in our product isn't it cool....' To impress the average Joe???