Algorithm And Heuristics
Páginas: 3 (540 palabras)
Publicado: 17 de diciembre de 2012
EPISCOPAL BILINGUAL SCHOOL
“EL BUEN PASTOR”
CLASS: Psychology
SUBJECT: Problem Solving
TEACHER: Mr. Alex Segura
STUDENT: Eduardo Enrique Bados Ruiz
GRADE: Tenth Grade
DATE:October 28, 2012
INTRODUCTION
In the following research I will talk to you about Algorithm and Heuristics.
OBJECTIVE
* To now what is Algorithm and Heuristic
* To identify the differenceof Algorithm an Heuristics
ALGORITHM
In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation,data processing,and automated reasoning.
More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initialinput (perhaps empty), the instructions describe a computation that, when executed, will proceed through a finite number of well-defined successive states, eventually producing "output" and terminatingat a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.Though algorism referred only to the rules of performing arithmetic using Hindu-Arabic numerals, a partial formalization of what would become the modern algorithm began with attempts to solve the Entscheidungsproblem (the"decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability" or "effective method"; those formalizations includedtheGödel–Herbrand–Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939. Givinga formal definition of algorithms, corresponding to the intuitive notion, remains a challenging problem
HEURISTICS
In psychology, heuristics are simple, efficient rules, hard-coded by...
“EL BUEN PASTOR”
CLASS: Psychology
SUBJECT: Problem Solving
TEACHER: Mr. Alex Segura
STUDENT: Eduardo Enrique Bados Ruiz
GRADE: Tenth Grade
DATE:October 28, 2012
INTRODUCTION
In the following research I will talk to you about Algorithm and Heuristics.
OBJECTIVE
* To now what is Algorithm and Heuristic
* To identify the differenceof Algorithm an Heuristics
ALGORITHM
In mathematics and computer science, an algorithm is a step-by-step procedure for calculations. Algorithms are used for calculation,data processing,and automated reasoning.
More precisely, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function. Starting from an initial state and initialinput (perhaps empty), the instructions describe a computation that, when executed, will proceed through a finite number of well-defined successive states, eventually producing "output" and terminatingat a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.Though algorism referred only to the rules of performing arithmetic using Hindu-Arabic numerals, a partial formalization of what would become the modern algorithm began with attempts to solve the Entscheidungsproblem (the"decision problem") posed by David Hilbert in 1928. Subsequent formalizations were framed as attempts to define "effective calculability" or "effective method"; those formalizations includedtheGödel–Herbrand–Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church's lambda calculus of 1936, Emil Post's "Formulation 1" of 1936, and Alan Turing's Turing machines of 1936–7 and 1939. Givinga formal definition of algorithms, corresponding to the intuitive notion, remains a challenging problem
HEURISTICS
In psychology, heuristics are simple, efficient rules, hard-coded by...
Leer documento completo
Regístrate para leer el documento completo.