PCP@HOME |
Привіт Гість ( Вхід | Реєстрація )
PCP@HOME |
nikelong |
Feb 22 2009, 01:56
Пост
#1
|
Тера ранчер Група: Trusted Members Повідомлень: 11 909 З нами з: 19-March 05 Користувач №: 92 Стать: Чол |
PCP@HOME http://www.theory.informatik.uni-kassel.de/~stamer/pcp/ http://www.rechenkraft.net/wiki/index.php?title=PCP%40HOME The PCP@Home project looks for short cases of Post's Correspondence Problem with large shortest solutions. This theoretical computer science problem has been in existence since 1946. It demonstrates undecidability: "a problem that cannot be solved for all cases by any algorithm whatsoever." Finding PCPs in this project will help define "decidability criteria for bounded PCP classes." To participate in the project, download a precompiled, statically linked executable for Linux ELF, FreeBSD ELF, Solaris 5.6, or Windows (you can also download and compile the source code), and also download a perl script called PcpSieve.pl which runs the executable, scans the output for record solutions, and emails the solutions to the project coordinator (you can also run the executable manually, search the output manually and email any record solutions you find). Note to Windows users: the Windows client was compiled by Michael Keppler of Rechenkraft.net. He says that it has a serious memory leak, and that you may need to kill it and restart it every day. If anyone knows how to debug Windows application memory leaks, please contact him. Це повідомлення відредагував nikelong: Mar 10 2009, 00:25 |
Lo-Fi Версія | Поточний час: 26th April 2024 - 16:14 |