Artificial intelligence

List of open problems in computer science

[Site] Computer science - Open Encyclopedia
... behavioral sciences. Arts and Humanities. Computer-aided engineering ... List of publications in computer science. List of open problems in computer science ...
open-encyclopedia.com/Computer_science

This article is a list of open problems in computer science.A solution to the problems in this list will have a major impact on the field of study to which they belong.

[News] ICT NEWS
Ireland is the single biggest exporter of software solutions in Europe and one of the top three software exporters in the world. High-technology software products now account for close to €12bn in exports, delivered by over 800 multinational and Irish-owned businesses.

P=NP?

Field: Theory of computation
Source: S. A. Cook and Leonid Levin, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151--158.
Description: P is the class of problems whose solution can be found in polynomial time. NP is the class of problems whose solution can be found in polynomial time with a non-deterministic algorithm or, equivalently, whose solution (if it exists) can be deterministically verified in polynomial time. Naturally, any problem in P is also in NP. The P versus NP question is whether NP is also a subset of P, and hence whether the classes are equal. One can see the question as a specific case of the problem in proving lower bounds for computational problems.
Importance: If the classes are equal then we can solve many problems that are currently considered intractable. If they are not, then NP-complete problems are problems that are provably hard.
Conjecture: Though the question is far from being settled, most experts believe that the classes are different.{{cite journal

 | last = Gasarch
 | first = William
 | title = The P=?NP Poll
 | journal = SIGACT News
 | volume = 33
 | issue = 2
 | pages = 34-47
 | date = [[2002]]
 | publisher = [[Association for Computing Machinery|ACM Press]]
 | url = http://www.cs.umd.edu/~gasarch/papers/poll.pdf
 | format = [[PDF]]
 | id = ISSN: 0163-5700
 | accessdate = 2007-06-12 }}

The existence of one-way functions

Field: Cryptography
Source: W. Diffie, M. E. Hellman, IEEE Trans. Inform. Theory, IT-22, 6, 1976, pp.644-654 [http
Description: One-way functions are easy to compute but hard to invert. Although there are several candidates for which no good (ie quick) reverse algorithms are currently known, it hasn't yet been proven that any function exists for which no such reverse algorithms exist.
Importance: If one-way functions do not exist then public key cryptography is impossible. Their existence would imply that many complexity classes are not learnable, and that P≠NP.
Conjecture: It is assumed but unproven that they do exist. Several encryption systems are based on the assumption that modular exponentiation is a one-way function.

[Video] A Joke Every Day - 226 - Blade Runner

Formalize (axiomatize) the Church-Turing thesis so that it can be proved or disproved

Source:

Nachum Dershowitz and Yuri Gurevich 2007, “A Natural axiomization of Church’s Thesis”. It appears on Gurevich’s website at http://research.microsoft.com/~gurevich. Observe not only the title, but the very first lines of the paper -- a quote from Shoenfield:

: ”We can write down some axioms about computable functions which most people would agree are evidently true. It might be possible to prove Church’s Thesis from such axioms – Joseph Shoenfield (1993)” (Dershowitz and Gurevich, 2007:1)

Dershowitz and Gurevich deliver their thesis in a nutshell:

:”Hence, it remains of real importance to provide a small number of convincing postulates in support of Church’s Thesis. Indeed, Gödel has been reported (by Church in a letter to Kleene cited by Davis in [1] Martin Davis, “Why Gödel didn’t have Church’s thesis”, ‘’Information and Control’’, vol. 54, pp. 3-24, July/August 1982 ) to have believed “that it might be possible . . . to state a set of axioms which would embody the generally accepted properties of calculability, and do something on that basis.”

:”[2] Kriesel described the discovery of “evident axioms about constructive functions” as “one of the really important open problems [3] Georg Kreisel, “Mathematical logic,” in T. L. Sasty, ed., Lectures in Modern Mathematics III, Wiley and Sons, New York, pp. 95-195, 1965 and “one of the more feasible problems at the present time” [4] Georg Kreisel, “Mathematical logic: what has it done for the philosophy of mathematics”, in Ralph Schoenman, ed., Bertrand Russell: Philosopher of the Century, Allen & Unwin, London, pp. 201-272, 1967.

[Post] What Open Access Means to Me
There are things that everyone involved in science can do to help out. Peter Suber at Open Access News has even made a list. Mainly I’ve tried to do my part by spreading the word, via this blog as well as in-person. ...

:”We propose just such an axiomatization in the sections that follow. We demonstrate that, under certain very natural hypotheses regarding algorithmic activity . . . Church’s Thesis is in fact provable.” (Dershowitz and Gurevich 2007:4)

Samual R. Buss, Alexander S. Kechris, Anand Pillay, and Richard A. Shore, June 2000, “The Prospects for Mathematical Logic in the Twenty-first Century”. This paper came from a panel discussion of the Association for Symbolic Logic held in Urbana-Champain. Shore stated the following three problems under the heading “Computer Science”:

”1. “Prove the Church-Turing thesis by finding intuitively obvious or at least clearly acceptable properties of computation that suffice to guarantee that any function so computed is recursive . . .. Perhaps the question is whether we can be sufficiently precise about what we mean by computation without reference to the method of carrying out the computation so as to give a more general or more convincing argument independent of the physical or logical implementation.

[Site] Open Problems and Projects
A New Kind of Science: Open Problems & Projects ... Pages 878-890 list 41 examples of cases where complex behavior was seen or was ...
www.wolframscience.com/openproblems/NKSOpenProblems.pdf

”2. What does physics have to say about computability (and provability or logic)? Do physical restrictions on the one hand, or quantum computing on the other, mean that we should modify our understanding of computability or at least study other notions?

[News] Transcript of presidential debate
Sens. John McCain and Barack Obama debated on the campus of the University of Mississippi Friday night. The moderator for the debate was Jim Lehrer of the NewsHour on PBS. What follows is the full transcript of the debate:

”3. Find, and argue conclusively for, a formal definition of algorithm and the appropriate analog of the Church-Turing thesis. . ..Thus we want a definition that will up to some precise equivalence relation capture the notion that two algorithms are the same as opposed to just computing the same function.” (p. 7-8)

Description:

The thesis states that "effective computation" (calculation) or algorithm can be carried out by a Turing machine (or an equivalent abstract computational device), for example, a deterministic, discrete-state, sequential, space-time limited (i.e. "bounded") process/method. But since such notions of “effective computation” are not well-enough defined and not presented as a small collection of axioms (Gödel's proposal), the thesis cannot be proven; rather, as was done by Kleene (who proposed the thesis) it must either be accepted as a conjecture based on "intuition" i.e. heuristics and empirical methods (observation and accumulation of evidence), or perhaps presented as a "definition" (the approach taken by Church and hotly criticized by Post), or else deemed a "natural law" requiring "continual verification" (Post's proposal hotly criticized by Church).

[Video] Buddy Franklin gets the ton.

Importance:

Acceptable axioms and a proof of the thesis will show that any behavior that can be called "computational" can be done by a Turing machine or equivalent. To show that the thesis is wrong will demonstrate or lead to new kinds of problems that are not computable and/or new methods that compute what cannot otherwise be computed by a Turing machine (or equivalent).

Current conjecture:

[Post] Frequently asked questions about AAMC
Moorthy received his Ph.D. from the Indian Institute of Technology and he teaches computer science at RPI. In addition to his classroom teaching and research, he has coached RPI's computer science competition team. For almost a decade, ...

”We propose just such an axiomatization in the sections that follow. We demonstrate that, under certain very natural hypotheses regarding algorithmic activity . . . Church’s Thesis is in fact provable.” (Dershowitz and Gurevich 2007:4)

Design a skilled Go-playing program

Field:

Artificial intelligence

[Site] Science - Math - Research - Open Problems - Unsolved Mathematics ...
Computer Science. Conferences. Directories. Earth Sciences. Educational Resources. Employment ... A list of unsolved problems published by MathPro Press during ...
www.sciencecentral.com/category/783615

Source:

Zobrist, Albert L. A model of visual organisation for the game Go. In Proceedings of the Spring Joint Computer Conference, volume 34, pages 103 - 112, 1969.
Zobrist, Albert L. Feature Extractions and Representation for Pattern Recognition and the Game of Go. Phd, Graduate School of the University of Wisconsin-Madison, August 1970.

[News] Article: iPhone Gems: Replicate Your Favorite Widgets, Part 1
Over the past few months, iLounge’s editors have been hunting widgets—more precisely, we’ve been looking for iPhone OS apps that duplicate the features of popular and useful Mac OS widgets. Apple already includes Stocks, Weather, Calculator and other features with every iPhone and iPod touch, but what about others—phone directory apps, the unit convertor, and package trackers? Or dictionary, ...

Description:

Go has long been considered a difficult challenge in the field of AI and has not yielded as easily as Chess. The first Go program was written by Albert Zobrist in 1968 as part of his thesis on pattern recognition. It introduced an influence function to estimate territory and Zobrist hashing to detect ko. Recent developments have brought the best programs close to shodan level on the small 9x9 board; however, it is not yet clear to what extent the success of the techniques used there will transfer to the case of the standard boardsize.

Currently, even mediocre players find it easy to beat the best Go programs. Some strong players have even beaten computer programs at handicaps of 25-30 stones, an enormous handicap that few human players would ever take. There is a case where the winning program in the 1994 World Computer Go Championship, Go Intellect, lost all 3 games against the youth players on a 15 stone handicap.See http://www.itee.uq.edu.au/~janetw/Computer%20Go/CS-TR-339.html#6.2 Strong players have not shown much interest in computer Go programs as serious opponents in contrast to examples such as the Chess match between Garry Kasparov and Deep Blue.

[Video] CS 61A Lecture 44: Review II

Importance:

Go is unlike chess, where the massive computing power of modern computer systems (and in particular dedicated chess machines like Hydra) together with relatively simple search and evaluation heuristics have proven marginally superior to the best human players. It is possible that techniques learned in the course of developing a strong Go program would transfer to more general problems in artificial intelligence to a greater degree than has been the case with chess.Read this article for more explanations on why computer go is so hard to write<

[Post] Genome Technology interview
On a side note, a large field in theoretical computer science — concurrency theory — works on ways to deal with this problem: rules for constructing programs so the errors are avoiding, or methods for ...

[Site] computer science: Definition from Answers.com
As with all sciences, these theories can then be utilised to synthesize ... List of open problems in computer science. List of prominent pioneers in computer science ...
www.answers.com/topic/computer-science

[News] Branding Trends: Engagement And Creation With Your Audience - The CoCreative Consumer
How can you, as a customer , get more engaged and involved in the process that defines the very product you are holding in your hands? How can you actually participate in the very definition of the traits that will characterize a product you like? Photo credit: Mikkel Have you ever desired to get more from an item you purchased? To explore its possibilities in order to get the best out ...

[Video] Go Open - Bruce Schneier Part 3 Full Interview

[Post] [Dbworld] (papers due this Firday): NIPS 2008 Workshop on Cost ...
We welcome both novel theory/algorithms and papers that highlight open problems and challenges in real-world applications which call for cost sensitive learning. Submissions on following topics are particularly encouraged: ...

[Site] Wikiwix - SD701 Open Directory > Science > Physics > History
Graduate Program in Radiological Sciences. School of Medicine ... List of open problems in computer science (81% ) Associated categories ...
wikiwix.com/?action=SD701+Open+Directory+>+Science+>+Physics+>+Hist...

[News] Student safety task force urged
Superintendent Dean Wittwer is calling for a task force to work out a plan to make Findlay's streets safe for students before and after school.

[Video] Go Open - Bruce Schneier Part 2 Full Interview

[Post] Initial draft (chapters)
Python because I wanted to make a computer game. I had taken several programming classes in college (C, C++, and Java) but nothing really serious. I’m not a Computer Science major and I don’t program on a professional level. ...

[Site] Science - Math - Topology - Open Problems - Thrackle.org, Kirby's ...
Problems list in PostScript ... Computer Science. Conferences. Directories. Earth Sciences. Educational Resources. Employment ...
www.sciencecentral.com/category/857755

[News] Updated Electoral Map: Obama Holds Steady at 311
It was deja vu all over again for John McCain last week. The rapid drop of the Dow Jones Industrial Average kept the economy front and center, playing into the hands of Barack Obama and Democrats up and down...

[Video] Go Open - Bruce Schneier Part 1 Full Interview

[Post] Mashable!
Alan Turing a mathematician considered to be the father of computer science, tackled the then-philosophical question that as to whether a computer could think, and if so, how we could tell. The suggestion he put forth was that if the ...

[Site] Trinity College
Faculty And Staff List. more About the Computer Science Department. Academic Resources ... algorithms and computer systems that help people solve problems. ...
www.trincoll.edu/Academics/Study/ComputerScience

[News] Curry County Commission candidate profiles
Editors Note: The Clovis News Journal asked the Curry County Commission candidates to answer the following questions in 200 words. The answers were edited for spelling and style. The general election is Nov. 4.

[Video] Imagine The Arsonist

[Post] Wednesday October 15, 2008
On this week’s list from the human resources department:. • Communications specialist, Communications and Public Affairs, USG 9 • Computing technology specialist, Computer Science Computing Facility, USG 10-12 ...

[Site] Computer science - Wikinfo
... sciences. Computer-aided engineering. Robotics. Human-computer ... List of publications in computer science. List of open problems in computer science ...
www.wikinfo.org/index.php/Computer_science

[News] Briefly in Tompkins
Due to the construction of an addition to Statler Hall, the short section of Campus Road between East Avenue and Hoy Road (between the two all-way stop signs) will be closed to vehicular traffic through Monday, Nov. 17.

[Video] Top Tech Trend #6: Evolution Trumps Design

[Post] Systems Engineer (alameda)
Additional responsibilities include functioning as second level support for the Information Technology Service Desk by responding to and addressing calls for assistance with computer problems and maintenance of the physical security and ...

[Video] Opencast Project Open House at UC Berkeley

[Post] Software Design - C++, Win 32, COM, Unit Testing (Seattle, WA, 98199)
Required Skills for this Software Design Engineer includes 6+ years in the following: * C++ * Win 32 * COM * Unit testing * Embedded * Good communication * Bachelor's degree in Computer Science, Engineering required Bonus Skills: * C# ...

[Video] New Directions in Multiprocessor Synchronization

[Post] Open Access, Science Commons, Open Science
Over at NCBI’s PubMed there is an open access repository of peer-reviewed articles, for which content is deposited in XML format. In a few words, Pubmed’s XML tags all sections of an article using computer-processable identifiers such ...