Talk:FO (complexity)

	Mathematics portal This redirect is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics 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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Mid	This redirect has been rated as Mid-priority on the project's priority scale.

Computer science

This redirect 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 articles

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}}

Number of articles edit

Latest comment: 13 years ago1 comment1 person in discussion

I'm not sure FO, SO and "descriptive complexity" need to be 3 articles, since DC is mainly FO and SO. Do you know how to decide if they should be merged in one. Else there is also another possibility: to create one article by operators (the descriptive complexity use of those operators) to give more details about the proof of the facts I stated. Can someone tell me what he thinks of it ? Arthur MILCHIOR (talk) 10:45, 8 June 2010 (UTC)Reply

Copy edit not needed edit

Latest comment: 12 years ago1 comment1 person in discussion

It was tagged for {{copy edit}}, but I found the English as such to be fine. I don't believe an article about a subject like this can be made any less technical, either. However, I suspect that the sentence "Usually the input is either a string (of bits or over an alphabet) the elements of which are positions of the string, or a graph of which the elements are vertices." is nonsense (a string whose elements are positions in the string?!). So I've placed an {{Expert-subject}} tag in its place. --Stfg (talk) 13:26, 12 January 2012 (UTC)Reply

Add topic