Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Bongard problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Pattern recognition puzzle}} [[File:Bongard_problem_convex_polygons.svg|thumb|300px|An example Bongard problem, the common factor of the left set being convex shapes (the right set are instead all concave).]] A '''Bongard problem''' is a kind of puzzle invented by the Soviet [[computer scientist]] [[Mikhail Bongard]] (1924β1971), probably in the mid-1960s. They were published in his 1967 book on [[pattern recognition]]. The objective is to spot the differences between the two sides. Bongard, in the introduction of the book (which deals with a number of topics including [[perceptron]]s) credits the ideas in it to a group including M. N. Vaintsvaig, V. V. Maksimov, and M. S. Smirnov.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)