Wikipedia:Reference desk/Computing: Difference between revisions
PrimeHunter (talk | contribs) →will there be 256-bit computers?: I bolded 265 to make fun of a typo |
|||
| Line 313: | Line 313: | ||
:::::[[User:PrimeHunter|PrimeHunter]], are you claiming that the 256-bit Data-Intensive Architecture (DIVA) system and the Transmeta Efficeon TM8300 256-bit Processor didn't happen, or are you claiming that the sources that say that they were 256-bit processors were telling a lie? --[[User:Guy Macon|Guy Macon]] ([[User talk:Guy Macon|talk]]) 16:18, 4 October 2018 (UTC) |
:::::[[User:PrimeHunter|PrimeHunter]], are you claiming that the 256-bit Data-Intensive Architecture (DIVA) system and the Transmeta Efficeon TM8300 256-bit Processor didn't happen, or are you claiming that the sources that say that they were 256-bit processors were telling a lie? --[[User:Guy Macon|Guy Macon]] ([[User talk:Guy Macon|talk]]) 16:18, 4 October 2018 (UTC) |
||
::::::I bolded '''265''' (not 256) to make fun of a typo in your first post. Maybe it was too subtle. [[User:PrimeHunter|PrimeHunter]] ([[User talk:PrimeHunter|talk]]) 16:23, 4 October 2018 (UTC) |
::::::I bolded '''265''' (not 256) to make fun of a typo in your first post. Maybe it was too subtle. [[User:PrimeHunter|PrimeHunter]] ([[User talk:PrimeHunter|talk]]) 16:23, 4 October 2018 (UTC) |
||
:::::::I assumed it was a subtle reference to Moon-landing deniers. [[Special:Contributions/216.59.42.36|216.59.42.36]] ([[User talk:216.59.42.36|talk]]) 17:36, 4 October 2018 (UTC) |
|||
= October 4 = |
= October 4 = |
||
Revision as of 17:36, 4 October 2018
of the Wikipedia reference desk.
Main page: Help searching Wikipedia
How can I get my question answered?
- Select the section of the desk that best fits the general topic of your question (see the navigation column to the right).
- Post your question to only one section, providing a short header that gives the topic of your question.
- Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
- Don't post personal contact information – it will be removed. Any answers will be provided here.
- Please be as specific as possible, and include all relevant context – the usefulness of answers may depend on the context.
- Note:
- We don't answer (and may remove) questions that require medical diagnosis or legal advice.
- We don't answer requests for opinions, predictions or debate.
- We don't do your homework for you, though we'll help you past the stuck point.
- We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.
How do I answer a question?
Main page: Wikipedia:Reference desk/Guidelines
- The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
September 27
So there's 2 types of 0's and 1's?
Can anyone provide feedback on there being 2 types of 0's and 1's in the motherboard. The 2 types being:
Spinning hard disks use magnetic orientation to encode 0/1 patterns.
And.
Solid state drives and DRAM use electric charge (or no charge) to encode 0/1 patterns.
So you have to have a device that can interpret both types? I'm looking into how the motherboard translates machine language. Thanks. 12.239.13.143 (talk) 00:34, 27 September 2018 (UTC).
- Actually there may be many more ways to encode 0's or 1's. They could be due to a voltage transition, or could be coded by a change in magnetism, multiple voltage levels, or even more complex codings. Mostly these differences will be handled by hardware or microcode in the device. A number of standards are used so that a device can send the data on the motherboard to the device, CPU or memory in a way that every thing can cope with. The hardware will convert from the internal code to the standard as used on the bus. see for example PCI Express, I²C, or USB. Graeme Bartlett (talk) 05:58, 27 September 2018 (UTC)
- Note that nearly all consumer SSDs released in the past 4? or more years use Multi-level cell, generally triple in the past year or so, meaning that more than one bit is stored in a cell via multiple voltage levels. While still very rare, some computers generally fancy servers may have devices with 3D XPoint which uses resistance. Some computers still have Optical disc drives. While often only used for data accessed temporarily or moved around (including backups), people sometimes may regularly use live CD/DVDs for their OS. While both CDs and DVDs (and most other Optical discs) are generally described to use pits and lands, in reality it's a little more complicated than that. Pressed discs do involve basically stamping pits onto the disc (see Compact Disc manufacturing), although the surface next to the reflective side (not the side you can touch as sometimes believed). But recordable discs (CD-R, DVD-R, DVD+R etc) generally involve changing the properties of a dye layer. Rewritable discs (CD-RW, DVD-RW, DVD+RW, DVD-RAM) use a phase-change material. But these are basically all read in the same way, sensing how a laser is reflected back. (Writing recordable and re-writeables also occurs using very similar operations.) Nil Einne (talk) 16:07, 27 September 2018 (UTC)
- It's not clear whether the OP is asking about different methods of storage or encoding. One method of encoding (NRZI) is that a 1 (or 0) is chosen to represent only the change from one state to the other, rather than the actual data bit value. The reading device must decode this in order to pass it along. Akld guy (talk) 21:05, 27 September 2018 (UTC)
ARM Cortex R52
Does anyone actually make an ARM Cortex R52[1] chip that I can buy? The only thing I could find is the NXP S32S24[2] but that one is preproduction. --Guy Macon (talk) 22:07, 27 September 2018 (UTC)
- This suggests STMicroelectronics have provided samples of their platform to one customer [3]. This source suggests the codename Stellar and sampling this year but not sure if this means more widely than that one customer [4]. (I think the second source is using one of those weird American dates which puts the month then the day then the year so it's dated before the first.) So select people can obtain them, possibly more later. I'm guessing if you had access to those sort of resources you wouldn't be asking here though. Nil Einne (talk) 22:42, 27 September 2018 (UTC)
- This is for a side project. The sad part is that if I told them that I do consulting for Mattel (true, but I am not on a Mattel project right now) and that I needed this for a Mattel project (a complete lie; we use much lower cost microcontrollers) they would fall over themselves assisting me. Damn these inconvenient ethics! :) --Guy Macon (talk) 02:28, 28 September 2018 (UTC)
Importing csv into OpenOffice dbase
Hi there. I'm trying to import records from csv to dbase (OpenOffice). I'm trying to follow instructions here:
https://forum.openoffice.org/en/forum/viewtopic.php?f=83&t=23260 (search for "This type of connection can be created if you follow this steps:")
It works fine if I use his csv:
ID,FirstName,Name,DOB 1,John,White,1960-01-23 2,Elisabeth,Smith,1972-11-10 3,Eric,Long,1987-04-07
But not if I use mine:
ID,Name,Status1,Status2,Phone 9018,linda,0,1,123123123123 9019,jenny,0,1,123123123123 9020,luke,0,1,123123123123 9021,mark,0,1,123123123123
How do I modify his line:
CREATE TEXT TABLE "Names" ("ID" INTEGER PRIMARY KEY, "FirstName" VARCHAR(20), "Name" VARCHAR(20), "DOB" DATE);
...so that it will work for my csv?
Many thanks for any help you can offer.
Anna Frodesiak (talk) 22:23, 27 September 2018 (UTC)
Never mind. I finally figured it out. Thanks anyhow. :) Anna Frodesiak (talk) 01:03, 28 September 2018 (UTC)
- (ec) I was about to suggest:
CREATE TEXT TABLE "Names" ("ID" INTEGER PRIMARY KEY, "Name" VARCHAR(20), "Status1" BOOLEAN, "Status1" BOOLEAN, "Phone" VARCHAR(20));
- This assumes that the status values are booleans (0/1 = false/true) and treats the phone number as text. Glad you figured it out. -- Tom N talk/contrib 01:14, 28 September 2018 (UTC)
- Hi Tom. Actually, I didn't figure it out after all. I did get my stuff into the dbase, but now I cannot make the primary key stick and cannot add new entries to the table. Is there no way to do this? It's driving me nuts. Anna Frodesiak (talk) 07:14, 28 September 2018 (UTC)
- As the ID colmn is a primary key, its unique per line/record and required. First enter a not existing number in the ID field, then follow the other fields. --Hans Haase (有问题吗) 20:29, 29 September 2018 (UTC)
- Hi Hans Haase. Thank you kindly. Actually, I was looking for a way to take the records from a csv and add them all at once to the dbase. For some odd reason, that does not seem possible. Anyhow, I've added them by hand. Thank you both anyway. :) Anna Frodesiak (talk) 20:59, 29 September 2018 (UTC)
- Hi, a primary key resets by reorganizing/recompressing the data base or drop and recreate the table. Base is a bit difficulty to handle. When taking calc to import and transfer the table from CSV? Success? --Hans Haase (有问题吗) 21:03, 29 September 2018 (UTC)
- Hi Hans Haase. Thank you kindly. Actually, I was looking for a way to take the records from a csv and add them all at once to the dbase. For some odd reason, that does not seem possible. Anyhow, I've added them by hand. Thank you both anyway. :) Anna Frodesiak (talk) 20:59, 29 September 2018 (UTC)
- Hi Hans Haase. I think I understand about primary keys. I just figured, as long as that column in csv is full of unique numbers, importing into dbase ought to be doable. Strange that it isn't. Also, there doesn't seem to be any way to even copy paste columns of data into an existing table. But all that doesn't matter now. I've done it all manually. Best, Anna Frodesiak (talk) 21:29, 29 September 2018 (UTC)
I figured it out for anyone in the future having trouble with this:
You don't need to save the spreadsheet in csv. You just need to highlight the columns in the spreadsheet, then in dbase/tables, right click on the empty space in the tables pane and click paste. That will make a table out of the spreadsheet column. If you allow it to make a primary key, then it becomes a usable table you can add to. Anna Frodesiak (talk) 06:49, 30 September 2018 (UTC)
September 28
Stockfish vs Houdini etc
I realize that computers can improve and also have fluctuations in their chess ratings, like humans do, but why is Stockfish in the mid 3200s rating and houdini is at 3400, since stockfish is so dominant? That's a huge difference in rating points.144.35.114.45 (talk) 01:18, 28 September 2018 (UTC)
- Your numbers are wrong.
- --Guy Macon (talk) 11:27, 30 September 2018 (UTC)
September 29
Transparent PNG images in MS Paint
In Microsoft Paint, how do I make a PNG that has a transparent background? In addition to the transparent background, there will be two foreground colours, used to draw a shape that is to be outlined in black and filled in white.
In the "Colors" menu, the "Edit colors..." option allows me to set colours using either hue/saturation/luminance (these are not compatible with the HSL values described here), or decimal RGB values, but there is no option to set the opacity/alpha value. --Redrose64 🌹 (talk) 18:36, 29 September 2018 (UTC)
- Does this help? Ruslik_Zero 20:57, 29 September 2018 (UTC)
- No: as the last person to comment there noted, it makes a white background, not transparent. --Redrose64 🌹 (talk) 22:56, 3 October 2018 (UTC)
How close are we to Full immersion/ deep dive vr?
WIll it happen within out lifetimes?
By uisng nervegear, nanobots, mind uploading, Neuralink maybe?
And if we get full dive vr will it be limited to gaming?
Or is it just all fantasy? — Preceding unsigned comment added by 60.241.172.251 (talk) 23:14, 29 September 2018 (UTC)
- See the top of the page: We don't answer requests for predictions. Including predicting the length of your life. --76.69.47.223 (talk) 02:33, 1 October 2018 (UTC)
- If you want to see the latest in full-immersion VR, look at the porn industry. That is where VR technology shows up first. For example, I was tasked with developing VR first-person shooters and VR surgery training simulations in 1994. All of the equipment, from the VR helmet to pressure-resistant gloves, was purchased from porn hardware producers because they had the most advanced hardware. In the gaming market, VR helmets weren't even using LCD screens and the pressure-resistant gloves only applied pressure to your index finger. Nowhere else. Now, they like to use the word "haptic." But, it is the same gear and for the latest experience you have to go to porn. You can currently get a 3-D VR helmet with 3-D sound and full-body (yes - FULL body) haptic suit with accompanying "entertainment" media. For video games, we're still using cheaper helmets (or your phone in a cardboard box) and one or two twiddle sticks. 216.59.42.36 (talk) 18:23, 2 October 2018 (UTC)
September 30
fatal error cannot set display mode serious sam 3
Hello there, I have been trying to play in my updated system. My specs are: Processor: Core 2 Quad, Graphics card (driver updated): Nvidia GTX 650, Direct X11, Ram 4 GB and OS Windows 7 64 BIT. Each time I tried to run the game as administrator I get that message. I tried searching google for answer but no solution yet. Here's my log file:
-------- START OF LOG --------
|
How can I solve this. Thanks in advance.103.231.162.134 (talk) 22:13, 30 September 2018 (UTC)
You search term suggests to me you've missed what seems to be the key takeaway from the log 'Failed to load dynamic module "D3DCompiler_43.dll"'. This error suggest to me a possible problem with DirectX and sure enough a simple search finds plenty of results where the same is suggested e.g. [8] [9] [10] (I wouldn't suggest you remove random DirectX 9 DLLs but it does support my conclusion). I suggest running the web DirectX installer [11]. If that doesn't work, you can see if anything here helps. [12]
Note that as attested by some of the forum threads, it's possible Serious Sam 3 may come with it's own DX redist. The trouble with relying on this is it could corrupted somehow, and it also could have problems with your current drivers if it's outdated. So running the web installer is likely the best choice. (And don't be confused by the dates. Since it's a webinstaller the content it retrieves is not directly affected by the date it was released.) On that note, although this seems to be a DirectX problem it is also possible it's a driver problem so make absolutely you have the latest drivers. Preferably from Nvidia although I admit the age of the game and card suggests the Windows Update ones are probably fine as well.
Note as also attested by some of the threads, you could try running this in DirectX 9 mode if the game supports it. However assuming the problem is a corrupted or outdated DirectX install, you're only masking the problem. (BTW if searches for the specific game don't find anything, it's often helpful to look at info for other games if it's a fairly specific error. Especially if they use a related engine.)
P.S. I probably should mention that while I still suggest you use the web installer, if SS3 does come with a redist and it's corrupt, this isn't a good sign either since it's possible other files could be corrupt. If this is a Steam variant, I would also suggest an integrity check [13]. Most games also have a 'first time run' mode where they run any installers etc. Unfortunately getting this to repeat is not so easy. You can look for any redists etc in the game's directory but you could still miss stuff [14] [15].
- Thank you for your detailed response. I tried almost everything you mentioned but none worked. After installing the game I didn't find any steam file. I separately downloaded steam software but did not workout. I downloaded the game from torrent website. Some people claimed it run perfectly, some had same problem like mine. I am thinking to download gold edition of SS3. I Will check that out.103.231.162.134 (talk) 22:47, 1 October 2018 (UTC)
- The key points of my admittedly long post and associated links are probably to run the the DirectX web installer, run SFC /SCANNOW, make absolutely sure your graphics drivers are up to date, and verify the integrity of your game content. You could take a look as dxdiag, but frankly it's not likely to be of use except to someone helping you. And if you've downloaded the game from a torrent website, I don't think it's likely you'll get further help here. More importantly, it's impossible to satisfy my last recommendation i.e. verify the game content. It could be that the problem is related to it being a questionable copy. Note that although torrents confirm the integrity of their content, this is only that it's the same as the person who made the torrent. I.E. It could easily be garbage in, garbage out if the person who made it has a problematic copy. (Even if it worked for the person, if the game had some sort of DRM, removing these isn't always clear cut and sometimes what's done may work for them but break things for others.) While this applies to Steam as well, the person or company with the (normally) legal rights to distribute the game is often more likely to get it right and at the very least isn't normally trying to remove DRM without access to the source code. But in any case, Steam isn't going to help, my mention of Steam only applied if you purchased the game from Steam. Note that, if you regularly run such content and especially if you have limited understanding of what you're doing, it's possible it has screwed with your system files or something. SFC /scannow may sometimes pick these up, but there's no guarantee they always will. Nil Einne (talk) 14:15, 2 October 2018 (UTC)
October 2
Spider traps and DOS
Spider trap says that these traps may "cause a web crawler or search bot to make an infinite number of requests". Why would you do such a thing intentionally? Sure, it stops the problematic crawler/bot/etc., but wouldn't the effect be a denial-of-service attack, since you're being given an infinite number of requests? I see that there are other options (e.g. serving massive text files or refusing entry to something lacking the right cookie) that might simply crash the spider, but causing it to make infinite responses seems counterproductive unless I'm misunderstanding the whole concept. Nyttend backup (talk) 18:52, 2 October 2018 (UTC)
- These pages suggest that they are normally unintentional, https://www.portent.com/blog/seo/field-guide-to-spider-traps-an-seo-companion.htm https://yoast.com/spider-trap/ . This pages has a comment that one purpose is to stop email address harvesting. Ways to deliberately DOS the spider, would be to pause before returning content, and then dynamically generate page text without using disk storage. Graeme Bartlett (talk) 02:19, 3 October 2018 (UTC)
- A request-loop trap does not seem very intelligent to me, either, as these things go. However, your server will escape DOS if its ability to answer requests is higher than the spider's ability to make them; that does not necessarily mean you need more processing power or network capability. Denial-of-service_attack#Attack_techniques contains some inspiration, but for instance, the spider might have fallen in many traps in different sites (so the spider is DDoS'd), if the cost of making a request is higher than that of answering it (some DoS attacks work because a small query packet can request a large, bandwidth-guzzling reply), if you intentionally answer the spider's query very slowly (forcing them to maintain a low-throughput connection), etc.
- In case you also wonder why you would set out traps for spiders... Well, I have one on my website, but you might as well read the original from whom I copied the idea rather than my summary. My own spambot trap is a page generating many
mailto:links to non-existent domains; there are links to that page by zero-width elements all over the website but is excluded in robots.txt. So the only ones who should read it, really, are non-robots.txt-compliant spiders, 99+% of which are malicious and 100% of which deserve at least what they get here. TigraanClick here to contact me 15:35, 3 October 2018 (UTC)
October 3
Space efficient index of a list
When you have several indexes, can you combine them to make them more efficient in terms of space?
If you wanted, for example, to access a list of names through 1st name or surname. Do you have to create necessarily one index for each? Intuitively, it makes sense to believe that you'll need 1 index for each way of accessing your information, but that wouldn't be a proof.
Speculative, I wonder whether there is some kind of data structure or hash value that could point to the right entry, when fed one or the other (1st name or surname). — Preceding unsigned comment added by Qlearn (talk • contribs) 00:49, 3 October 2018 (UTC)
- I think the idea of having a general hash that could be generated by either of two seperate records is impossible. I expect it is a lot less efficient than having two indexes but of course you could use the LIKE function; name "John Smith" and search "WHERE NAME LIKE '%John%';" or "WHERE NAME LIKE '%smith%'"; -- Q Chris (talk) 11:09, 3 October 2018 (UTC)
- You could always compress the string. The gain would be minimal and in the practice you don't want to trade processing speed for being stored efficiently. --Doroletho (talk) 13:00, 3 October 2018 (UTC)
Windows installer
Windows installer works great![16] --Guy Macon (talk) 07:11, 3 October 2018 (UTC)
![[16]](https://i3.wp.com/eastcoastwindowsanddoors.com/wp-content/uploads/2018/07/Home-Window-Installation.jpg){kind=link}
- Very funny. And what's your question? --Doroletho (talk) 11:00, 3 October 2018 (UTC)
- If an ip user posted this they would be reverted for trolling. — Preceding unsigned comment added by 186.148.165.180 (talk) 11:46, 3 October 2018 (UTC)
- I am sorry if that has been your experience. IPs should be treated the same as registered users, and I have seen editors get warned for treating IPs differently from registered editors -- and blocked for repeat offenses. All editors are required to obey WP:TPOC. A small amount of humor is allowed on Wikipedia outside of our actual articles:, see Wikipedia:Humor#Humor outside of articles. We have help for those who have trouble telling the difference between humor and trolling at meta:What is a troll?, along with an article on the concept at Internet troll. --Guy Macon (talk) 12:55, 3 October 2018 (UTC)
- If you are one of those linux evangelists poking fun at Windows, I'd like to say that Windows is easier to install than Linux and on the top of that has improved several aspects in the last years. --Doroletho (talk) 13:07, 3 October 2018 (UTC)
- I am not a Linux evangelist poking fun at Windows. I use both and have found that Windows 10 is somewhat easier to install than Ubuntu and much easier to install than Slackware (Motto: "Slackware is user friendly. It's just picky about who its friends are"). Please don't try to read some hidden meaning into a lighthearted joke. --Guy Macon (talk) 13:44, 3 October 2018 (UTC)
- but like what is your question even lol ~Helicopter Llama~ 14:54, 3 October 2018 (UTC)
- I apologize. I somehow failed to realize that we are on Jeopardy!, where the rules say that you must must phrase your response in the form of question. (the presence of Alex Trebek should have clued me in).
- When performing a Windows installation,[17] are hard hats required? Is there a problem with the average house having heavy things falling on your head that I was unaware of? And shouldn't the workers pictured also be wearing orange safety vests? --Guy Macon (talk) 15:31, 3 October 2018 (UTC)
- Typical. Two people loudly insist that I make a comment in the form of a question, then neither of them attempts to actually answer the question... (note to the humor impaired; please attempt to understand the concept of "a joke".) --Guy Macon (talk) 16:03, 4 October 2018 (UTC)
Weird Excel table behaviour
There's a very convoluted story that I'm trying to avoid having to tell. :) The short version is that I have a series of defined tables, each on their own tab. They each do a series of calculations based on a complicated SUMIFS formula to help me present a variety of different bits of information, all drawn from a data dump (also on a separate tab). When I first created the formulas they naturally ended up with negative values. This was totally expected and the formulas are doing their thing properly. However, to make graphing easier to read, it was later decided to invert the values by multiplying them by -1. All good so far. However, when I go to add another week, the table "forgets" the new formula and the new row shows as negatives. So, assuming a scenario where each of the following weeks should show as "10", my table results in this:
| Fiscal Week | Cases credited |
|---|---|
| W01 | 10 |
| W02 | 10 |
| W03 | -10 |
This forces me to fix each row manually by grabbing the previous week and dragging it down to the next row. It's very tedious. How can I gain access to see what Excel "thinks" the formula should be and change it? Even though every cell in every column shows as (complicated SUMIFS formula)*-1, subsequent new rows all forget to add the "*-1". I've drawn three weeks and a single column in here as an example, but in reality there are very many more so I would prefer not to have to redo all of them from scratch. Any help would be appreciated. Matt Deres (talk) 17:46, 3 October 2018 (UTC)
- If the data is correct and the answer is "wrong" (= undesired) then the formula is the thing to fix. It sounds like you need to add to your formula one or both of these functions that are available in Excel:
- SIGN Returns the sign (+1, -1 or 0) of a supplied number
- ABS Returns the Absolute value of a supplied number
- DroneB (talk) 19:01, 3 October 2018 (UTC)
- Maybe I did not explain myself properly. If you were to examine the file right now, every single formula would be correct and giving the proper value. The problem develops when I add the next week in. In the example above, if I enter "W04" in the appropriate cell, Excel automatically extends the formulas in all the other columns - it's a standard function of a formally defined table. The problem is that the automatically created formulas are the old ones with negative values. I have to highlight the row above and manually drag down the updated formulas myself to correct it. Excel is somehow remembering the original formulas I used rather than simply extending the current ones. Matt Deres (talk) 12:36, 4 October 2018 (UTC)
will there be 256-bit computers?
AWNSER THA QUASTON. — Preceding unsigned comment added by A Loaf Of Bread 2 (talk • contribs) 20:13, 3 October 2018 (UTC)
- See the top of the page "We don't answer requests for opinions, predictions or debate." Dmcq (talk) 20:22, 3 October 2018 (UTC)
- In this case, the "requests for predictions" is a lot like asking "will men ever walk on the moon?" The 2002 Data-Intensive Architecture (DIVA) system was the first 256-bit processor that I know of,[18] the Transmeta Efficeon TM8300 256-bit Processor was released in 2004, and of course there is the AVX-512 and the Nvidia Quadro FX5800. Of course you can always play a game on No True Scotsman if you want to deny that 265-bit processors exist... --Guy Macon (talk) 21:45, 3 October 2018 (UTC)
- I deny that 265-bit processors exist. PrimeHunter (talk) 22:29, 3 October 2018 (UTC)
- There are some google resutls about it: "265-bit+processor". --Qlearn (talk) 11:13, 4 October 2018 (UTC)
- I deny that 265-bit processors exist. PrimeHunter (talk) 22:29, 3 October 2018 (UTC)
- In this case, the "requests for predictions" is a lot like asking "will men ever walk on the moon?" The 2002 Data-Intensive Architecture (DIVA) system was the first 256-bit processor that I know of,[18] the Transmeta Efficeon TM8300 256-bit Processor was released in 2004, and of course there is the AVX-512 and the Nvidia Quadro FX5800. Of course you can always play a game on No True Scotsman if you want to deny that 265-bit processors exist... --Guy Macon (talk) 21:45, 3 October 2018 (UTC)
- PrimeHunter, are you claiming that the 256-bit Data-Intensive Architecture (DIVA) system and the Transmeta Efficeon TM8300 256-bit Processor didn't happen, or are you claiming that the sources that say that they were 256-bit processors were telling a lie? --Guy Macon (talk) 16:18, 4 October 2018 (UTC)
- I bolded 265 (not 256) to make fun of a typo in your first post. Maybe it was too subtle. PrimeHunter (talk) 16:23, 4 October 2018 (UTC)
- PrimeHunter, are you claiming that the 256-bit Data-Intensive Architecture (DIVA) system and the Transmeta Efficeon TM8300 256-bit Processor didn't happen, or are you claiming that the sources that say that they were 256-bit processors were telling a lie? --Guy Macon (talk) 16:18, 4 October 2018 (UTC)
- I assumed it was a subtle reference to Moon-landing deniers. 216.59.42.36 (talk) 17:36, 4 October 2018 (UTC)