Showing posts with label Haken. Show all posts
Showing posts with label Haken. Show all posts
22 April 2015
The 2nd International Conference on Algorithms for Computational Biology (AlCoB 2015) / go to DF in August -- Vleeptron SWEARS you'll love the food if Plaza Garibaldi's still there / do not yell "Taxi!" in front of your hotel / if you're in Holy Orders, wear your vestments, it's legal now
Click image and postage meter to enlarge.
The 2nd International Conference on
Algorithms for Computational Biology
(AlCoB 2015)
invites authors to submit work in progress for presentation.
AlCoB 2015 will be held in Mexico City on August 4-6, 2015. See
http://grammars.grlmc.com/alcob2015/
Presentations are intended to enhance informal interactions with conference participants, at the same time permitting in-depth discussion.
TOPICS
Authors can submit presentations describing novel work in progress on any of the topics within the scope of the conference. They do not need to contain final results, but research that may lead to future interesting developments
is welcome.
KEY DATES
Submission deadline: June 26, 2015
Notification of acceptance or rejection: 7 days after submission
SUBMISSION
Please submit a .pdf abstract through:
https://www.easychair.org/conferences/?conf=alcob2015
It should contain the title, author(s) and affiliation, and should not exceed 500 words.
PRESENTATION
Each presentation will be allocated 15 minutes in the programme.
PUBLICATION
The presented work will not appear in the LNCS/LNBI proceedings volume of AlCoB 2015. However, it will be eligible for submission to the post-conference Journal of Computational Biology special issue.
REGISTRATION
Authors of work in progress have to register to the conference. They will pay a reduced fare. This comprises access to all sessions, one copy of the proceedings volume, coffee breaks and lunches.
---
Este mensaje no contiene virus ni malware porque la protección de avast! Antivirus está activa.
http://www.avast.com
Labels:
4 color conjecture,
Appel,
Coq,
DF,
Haken,
Mexico City,
Plaza Garibaldi,
proof assistant,
Riva Palacio
07 January 2014
Slightly tarted up V.2 t-shirt & (someone else's) explanation of solution to 4CC = 4CP
Click t-shirt to enlarge,
view vid in Fullscreen
A neighbor seems to sincerely enjoy my whack t-shirts, so for Christmas i cranked him out the 4CC / postage meter t-shirt after i made the red brighter on the metered postage from the math department of the University of Illinois / Champaign-Urbana. Haken and Appel stole about 2 years of time off the federal supercomputer on campus to analyze a huge number of distinct geopolitical map cases.
FOUR COLORS
....SUFFICE
The math department featured the postage ad when they published their proof in 1976. (The faint PB is for Pitney-Bowes, the Ruler of Earth with hand-cranked and electromechanical business postage meters.)
With some help from their Big Silicon Friend (an IBM), they put UI C-A on the math map and on the Big List of Platonic Objects.
One tiny aspect of this perfectly legitimate proof wafts up the nostrils of many mathematicians like the 5-day-old sidewalk harring in my hotel minibar fridge.
Only a digital computer can assemble this proof.
And having claimed to have proven it, only another digital computer can verify the work of the first computer.
4CC is the first Proof humans have encountered or cobbled together which is too vast to reside in a single human brain. Thus the stale harring aroma to the nostrils of many carbon-based sentients.
In the video, a very nice nerdo Italiano (YouTube courtesy PatfromCH) gives a vidboard demonstration proving a famous aspect of the 4CC = 4CP.
Since this idiot-easy child-grokable question
For any conceivable geopolitical map, what is the most distinct colors needed so no contiguous regions (regions sharing a border of non-zero length) are colored alike?
... was first asked (by Francis Guthrie) in 1852, it took Earth's brainiest mathematicians 124 years to prove (or help the supercomputer prove) the answer.
Minkowski told his graduate students that the reason no one had proved 4CC was that only third-rate mathematicians had studied the problem. Some months later he announced: "Heaven is angry at my arrogance. My proof is defective."
Worse than idiot-simple ... print shops had been printing such geopolitical maps for centuries, and THEY always knew they'd never, ever have to print a map that needed 5 colors. In centuries of printing screwy, arbitrary-shaped maps -- Guthrie used the counties of England, other examples are the countries of Eurasia or the "lower 48" USA states -- they'd never found a map that couldn't be printed in 4 colors. (Most only require 3 colors.)
But of course it's not a commercial printer's job to prove fundamental platonic object conjectures in topology. They just print maps.
***********
Maybe more later. I'm hungry. And the Polar Vortex has trapped us and the cats in the cabin. If we go outside for longer than 15 minutes we will get frostbite and have to have body parts amputated.
Labels:
4CC,
4CP,
Appel,
Francis Guthrie,
Haken,
Minkowski,
U Illinois Champagne Urbana
Subscribe to:
Posts (Atom)


