25,161
edits
Changes
Created page with "'''Home * People * Philip Bursky''' '''Philip (Phil) Bursky''',<br/> an American electrical engineer and computer scientist. Along with James R. Slagle..."
'''[[Main Page|Home]] * [[People]] * Philip Bursky'''
'''Philip (Phil) Bursky''',<br/>
an American electrical engineer and computer scientist.
Along with [[James R. Slagle]], Philip Bursky co-authored ''A Multipurpose, Theorem-Proving Heuristic Program'' using the game of [[Kalah]] <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref> .
Phil Bursky defended his B.Sc and M.Sc. in [https://en.wikipedia.org/wiki/Electrical_engineering Electrical engineering] at [[Massachusetts Institute of Technology]] in 1957 and 1963,
and was affiliated with the [[Lawrence Livermore National Laboratory|Lawrence Radiation Laboratory]], [https://en.wikipedia.org/wiki/University_of_California University of California] and the [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania], before working in the industry <ref>[https://www.linkedin.com/in/phil-bursky-b41b808/ Phil Bursky | LinkedIn]</ref>.
=Theorem-Proving=
Abstract of ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref>
The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about [[Kalah]] end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the [[Alpha-Beta]] minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/b/Bursky:Philip dblp: Philip Bursky]</ref>
* [[Philip Bursky]] et al. ('''1968''').''[https://repository.upenn.edu/cis_reports/797/ A Man-Machine Competitive Game: A Naval Duel]''. [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania]
* [[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1 <ref>[https://www.projecteuclid.org/euclid.jsl/1183735759 David C. Cooper] ('''1970'''). ''[https://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jsl/1183737432 Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program]''. [https://en.wikipedia.org/wiki/Journal_of_Symbolic_Logic Journal of Symbolic Logic], Vol. 35, No. 4</ref>:
* [[Mathematician#JWCarrIII|John W. Carr III]], [https://dblp.uni-trier.de/pers/hd/p/Prywes:Noah_S= Noah S. Prywes], [[Philip Bursky]], et al. ('''1970''').''[https://repository.upenn.edu/cis_reports/824/ Man-Computer Problem Solving in Real-Time Naval Duels]''. [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania]
=External Links=
* [https://www.linkedin.com/in/phil-bursky-b41b808/ Phil Bursky | LinkedIn]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Researcher|Bursky]]
'''Philip (Phil) Bursky''',<br/>
an American electrical engineer and computer scientist.
Along with [[James R. Slagle]], Philip Bursky co-authored ''A Multipurpose, Theorem-Proving Heuristic Program'' using the game of [[Kalah]] <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref> .
Phil Bursky defended his B.Sc and M.Sc. in [https://en.wikipedia.org/wiki/Electrical_engineering Electrical engineering] at [[Massachusetts Institute of Technology]] in 1957 and 1963,
and was affiliated with the [[Lawrence Livermore National Laboratory|Lawrence Radiation Laboratory]], [https://en.wikipedia.org/wiki/University_of_California University of California] and the [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania], before working in the industry <ref>[https://www.linkedin.com/in/phil-bursky-b41b808/ Phil Bursky | LinkedIn]</ref>.
=Theorem-Proving=
Abstract of ''Experiments With a Multipurpose, Theorem-Proving Heuristic Program''. <ref>[[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref>
The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied. As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about [[Kalah]] end games. Kalah is a two-person game. In another experiment the program, after some modifications, played the game of Kalah. This program was compared with another tree-searching procedure, the [[Alpha-Beta]] minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.
=Selected Publications=
<ref>[https://dblp.org/pers/hd/b/Bursky:Philip dblp: Philip Bursky]</ref>
* [[Philip Bursky]] et al. ('''1968''').''[https://repository.upenn.edu/cis_reports/797/ A Man-Machine Competitive Game: A Naval Duel]''. [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania]
* [[James R. Slagle]], [[Philip Bursky]] ('''1968'''). ''[https://dl.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1 <ref>[https://www.projecteuclid.org/euclid.jsl/1183735759 David C. Cooper] ('''1970'''). ''[https://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.jsl/1183737432 Review: James R. Slagle, Philip Bursky, Experiments with a Multipurpose, Theorem-Proving Heuristic Program]''. [https://en.wikipedia.org/wiki/Journal_of_Symbolic_Logic Journal of Symbolic Logic], Vol. 35, No. 4</ref>:
* [[Mathematician#JWCarrIII|John W. Carr III]], [https://dblp.uni-trier.de/pers/hd/p/Prywes:Noah_S= Noah S. Prywes], [[Philip Bursky]], et al. ('''1970''').''[https://repository.upenn.edu/cis_reports/824/ Man-Computer Problem Solving in Real-Time Naval Duels]''. [https://en.wikipedia.org/wiki/University_of_Pennsylvania University of Pennsylvania]
=External Links=
* [https://www.linkedin.com/in/phil-bursky-b41b808/ Phil Bursky | LinkedIn]
=References=
<references />
'''[[Engines|Up one level]]'''
[[Category:Researcher|Bursky]]
