Talk:Alternating Turing machine

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Computer science Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Universal state

This needs to be included - and Disambiguated. --Ludvikus (talk) 04:20, 29 September 2009 (UTC)[reply]

Universal Turing machine

There's no "See also" section as to the above. Shouldn't there be? --Ludvikus (talk) 14:09, 29 September 2009 (UTC)[reply]

Bounded alternation

For some reason, there was nothing about bounded alternation on wikipédia, I added a section.

For classes of function C closed under polynomials, ATIME(C,j)=TIME(C)^{\Sigma^P_j}, it means that having alternations or oracles in the PH (complexity) is the same thing. I would like if anyone can give a reference, the only one I have is a paper I intend to submit to a journal, but I guess this result is already known.Arthur MILCHIOR (talk) 08:08, 31 July 2010 (UTC)[reply]

External links modified

Hello fellow Wikipedians,

I have just modified one external link on Alternating Turing machine. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Corrected formatting/usage for http://users.cis.fiu.edu/~giri/teach/5420/f01/papers/p114-chandra.pdf

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at {{Sourcecheck}}).

Y An editor has reviewed this edit and fixed any errors that were found.

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—^{cyberbot II}_{Talk to my owner:Online} 14:06, 25 April 2016 (UTC)[reply]