SlideShare a Scribd company logo
1 of 1
Entscheidungsproblem consists of a challenge for finding an algorithm that takes as input a
mathematical statement and produces as output a statement that may be true or false. Then Alan
Turing proposed to settle Hilbert’s Entscheidungsproblem, by incorporating basic math in machines.
Turing gave rise to a Turing machine, a finite program that deploys symbols on tape according to a table
of rules. The Turing machines were partially computable. A function is computable if it is partially
computable and halts for every natural number. Turing stated that halting made imposible to solve the
Hilbert’s problem. Turing also contributed to reading and breaking the German navigational codes
during the Second World War. The contributions of Turin to the scientific world were that he built a
system in which the present computers are based on. So basically he led to the formation of todays
computer.

More Related Content

Similar to 2nd seminar reflection

Similar to 2nd seminar reflection (6)

Turing
TuringTuring
Turing
 
Alan Turing
Alan TuringAlan Turing
Alan Turing
 
Turing revolution presentation(SCIENCE TECHNOLOGY SOCIETY)
Turing revolution presentation(SCIENCE TECHNOLOGY SOCIETY)Turing revolution presentation(SCIENCE TECHNOLOGY SOCIETY)
Turing revolution presentation(SCIENCE TECHNOLOGY SOCIETY)
 
Alan turing
Alan turingAlan turing
Alan turing
 
Alan turing
Alan turingAlan turing
Alan turing
 
History of computers - Modern
History of computers - ModernHistory of computers - Modern
History of computers - Modern
 

More from javierzavala1995

More from javierzavala1995 (20)

Reflective essay biology class
Reflective essay biology classReflective essay biology class
Reflective essay biology class
 
Argumentative essay
Argumentative essayArgumentative essay
Argumentative essay
 
Phage presentation spring 2014-2
Phage presentation  spring 2014-2Phage presentation  spring 2014-2
Phage presentation spring 2014-2
 
Final osmosis summary
Final osmosis summaryFinal osmosis summary
Final osmosis summary
 
Phage hunters 2014 (2)
Phage hunters 2014 (2)Phage hunters 2014 (2)
Phage hunters 2014 (2)
 
Final research paper
Final research paperFinal research paper
Final research paper
 
Final nanoparticles summary
Final nanoparticles summaryFinal nanoparticles summary
Final nanoparticles summary
 
Final coliphages summary
Final coliphages summaryFinal coliphages summary
Final coliphages summary
 
Final microscopy summary
Final microscopy summaryFinal microscopy summary
Final microscopy summary
 
Final nanotechnology summary
Final nanotechnology summaryFinal nanotechnology summary
Final nanotechnology summary
 
Final dna summary
Final dna summaryFinal dna summary
Final dna summary
 
Curriculum vitae
Curriculum vitaeCurriculum vitae
Curriculum vitae
 
Annotated bibliographies
Annotated bibliographiesAnnotated bibliographies
Annotated bibliographies
 
Annotated bibliographies
Annotated bibliographiesAnnotated bibliographies
Annotated bibliographies
 
Total artificial heart review paper
Total artificial heart review paperTotal artificial heart review paper
Total artificial heart review paper
 
4rth seminar reflection
4rth seminar reflection4rth seminar reflection
4rth seminar reflection
 
3rd seminar reflection
3rd seminar reflection3rd seminar reflection
3rd seminar reflection
 
1st seminar reflection
1st seminar reflection1st seminar reflection
1st seminar reflection
 
3rd annotated biblography
3rd annotated biblography3rd annotated biblography
3rd annotated biblography
 
2nd annotated biblography
2nd annotated biblography2nd annotated biblography
2nd annotated biblography
 

2nd seminar reflection

  • 1. Entscheidungsproblem consists of a challenge for finding an algorithm that takes as input a mathematical statement and produces as output a statement that may be true or false. Then Alan Turing proposed to settle Hilbert’s Entscheidungsproblem, by incorporating basic math in machines. Turing gave rise to a Turing machine, a finite program that deploys symbols on tape according to a table of rules. The Turing machines were partially computable. A function is computable if it is partially computable and halts for every natural number. Turing stated that halting made imposible to solve the Hilbert’s problem. Turing also contributed to reading and breaking the German navigational codes during the Second World War. The contributions of Turin to the scientific world were that he built a system in which the present computers are based on. So basically he led to the formation of todays computer.