DOCSLIB.ORG

A Brief History of Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Brief History of Computing ABriefHistoryofComputing Xmas Lecture Prof. Dr. Jörg Schäfer 23 December, 2010 Prologue 3 Disclaimer.................................................................... 4 Famous(Computer)ScientistsQuotes................................................. 5 Famous(Computer)EngineersQuotes................................................. 6 A Brief History of Computers 7 Stonehenge................................................................... 8 Abacus...................................................................... 9 Al-Chwarizmi................................................................. 10 LeonardodaVinci.............................................................. 11 Pascaline.................................................................... 12 Leibniz01................................................................... 13 Charles Babbage’s Difference Engine . ................................................ 14 Charles Babbage’s Analytical Engine . ................................................ 15 TheFirstProgrammer........................................................... 16 Inspiration for Cyberpunk. ....................................................... 17 Inspiration for Steampunk . ....................................................... 18 Power(Jacquard)Looms......................................................... 19 IBM,formerlyknownasHollerith ................................................... 20 KonradZuse–Z1.............................................................. 21 AlanTuring[Tur01] ............................................................ 22 JohnvonNeumann[Neu45]....................................................... 23 VonNeumannArchitecture ....................................................... 24 GraceHopper................................................................. 25 TheFirstBug ................................................................ 26 AnalogComputers ............................................................. 27 OtherAnalogComputers......................................................... 28 Moore’sLaw ................................................................. 29 Unix[RT74].................................................................. 30 Macs ...................................................................... 31 PCs....................................................................... 32 UbiquitousComputers........................................................... 33 Quantum Computing. ........................................................... 34 ABriefHistoryofProgrammingLanguages 35 WhyareLanguagesImportant?..................................................... 36 LanguagesasToolsforThinking.................................................... 37 LanguageEvolution............................................................. 38 1940s . .................................................................. 39 1940s cont. .................................................................. 40 MachineLanguage............................................................. 41 1950s . .................................................................. 42 1950s cont. .................................................................. 43 1 Assembly.................................................................... 44 Fortran–I................................................................... 45 Fortran–II.................................................................. 46 Algol68–I................................................................... 47 Algol68–II.................................................................. 48 Lisp....................................................................... 49 1960s . .................................................................. 50 1960s . .................................................................. 51 Basic ...................................................................... 52 Cobol...................................................................... 53 1970s . .................................................................. 54 1970s . .................................................................. 55 Hackers..................................................................... 56 C......................................................................... 57 Prolog...................................................................... 58 Smalltalk.................................................................... 59 1980s . .................................................................. 60 1980s . .................................................................. 61 C++–I.................................................................... 62 C++–II.................................................................... 63 Python..................................................................... 64 1990s . .................................................................. 65 1990s cont. .................................................................. 66 1990s cont. .................................................................. 67 Haskell..................................................................... 68 Java....................................................................... 69 2000s . .................................................................. 70 MapReduce.................................................................. 71 Summary: ProgrammingLanguages’Paradigms ......................................... 72 InterpretationofParadigms ....................................................... 73 ShootingYourself.............................................................. 74 ProgrammingLanguagesasseenbyFans.............................................. 75 LanguagesasToolsforProgramming................................................. 76 A Brief History of Networks 77 TheWorldisConnected ......................................................... 78 ThePoweroftheNetwork........................................................ 79 A Brief History of Applications 80 ImportantApplications .......................................................... 81 ABriefHistoryofComputerScientistsandEngineers 82 FamousComputerScientistsandEngineers ............................................ 83 A Brief History of Challenges 84 DifferentDisciplines ............................................................ 85 Speaking DifferentLanguages–ExampleI............................................. 86 Speaking DifferentLanguages–ExampleII ............................................ 87 WhatcanweCompute?.......................................................... 88 HowtodealwithComplexity? ..................................................... 89 Outlook 90 TheFutureofComputing ........................................................ 91 Appendix 92 References................................................................... 93 Credits–I/III................................................................. 94 Credits–II/III................................................................ 95 Credits–III/III................................................................ 96 2 Content Prologue A Brief History of Computers A Brief History of Programming Languages A Brief History of Networks A Brief History of Applications A Brief History of Computer Scientists and Engineers A Brief History of Challenges Outlook c Jörg Schäfer http://user.fh-frankfurt.de/~jschaefer/lectures/ ABriefHistoryofComputing–2/96 ! Prologue 3/96 Disclaimer The following slides contain an entirely subjective view of (computer) history! Due to laziness, some notes contain Wikipedia as a “reference” – please consider this as an anti-pattern and never use Wikipedia as a “reference” in any serious scientific report! c Jörg Schäfer http://user.fh-frankfurt.de/~jschaefer/lectures/ ABriefHistoryofComputing–4/96 ! 3 Famous (Computer) Scientists Quotes Computer science is no more about computers than astronomy is about telescopes. Edsger Dijkstra Computer science also differs from physics in that it is not actually a science. It does not study natural objects. Neither is it, as you might think, mathematics; although it does use mathematical reasoning pretty extensively. Rather, computer science is like engineering; it is all about getting something to do something, rather than just dealing with abstractions, as in the pre-Smith geology. Richard Feynman, Feynman Lectures on Computation, 1970 c Jörg Schäfer http://user.fh-frankfurt.de/~jschaefer/lectures/ ABriefHistoryofComputing–5/96 ! Famous (Computer) Engineers Quotes Ithinkthereisaworldmarketformaybefivecomputers. Thomas Watson, Chairman of IBM, 1943 There is no reason anyone in the right state of mind will want a computer in their home. Ken Olson, President of Digital Equipment Corp, 1977 640k is enough for anyone, and by the way, what’s a network? William Gates III, President of Microsoft Corporation, 1984 The most profound technologies are those that disappear: they weave themselves into fabric of everyday life until are indistinguishable from it. Mark Weiser, The Computer for the 21st Century, Scientific American, 1991 c Jörg Schäfer http://user.fh-frankfurt.de/~jschaefer/lectures/ ABriefHistoryofComputing–6/96 ! 4 ABriefHistoryofComputers 7/96 Stonehenge Stonehenge ← 100 0 100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400 1500 1600 1700 1800 1900 − c Jörg Schäfer http://user.fh-frankfurt.de/~jschaefer/lectures/ ABriefHistoryofComputing–8/96 ! Stonehenge is a prehistoric monument located
Load more

Recommended publications
  • Introduction to Computer System
    Chapter 1 INTRODUCTION TO COMPUTER SYSTEM 1.0 Objectives 1.1 Introduction –Computer? 1.2 Evolution of Computers 1.3 Classification of Computers 1.4 Applications of Computers 1.5 Advantages and Disadvantages of Computers 1.6 Similarities Difference between computer and Human 1.7 A Computer System 1.8 Components of a Computer System 1.9 Summary 1.10 Check your Progress - Answers 1.11 Questions for Self – Study 1.12 Suggested Readings 1.0 OBJECTIVES After studying this chapter you will be able to: Learn the concept of a system in general and the computer system in specific. Learn and understand how the computers have evolved dramatically within a very short span, from very huge machines of the past, to very compact designs of the present with tremendous advances in technology. Understand the general classifications of computers. Study computer applications. Understand the typical characteristics of computers which are speed, accuracy, efficiency, storage capacity, versatility. Understand limitations of the computer. Discuss the similarities and differences between the human and the computer. Understand the Component of the computer. 1.1 INTRODUCTION- Computer Today, almost all of us in the world make use of computers in one way or the other. It finds applications in various fields of engineering, medicine, commercial, research and others. Not only in these sophisticated areas, but also in our daily lives, computers have become indispensable. They are present everywhere, in all the dev ices that we use daily like cars, games, washing machines, microwaves etc. and in day to day computations like banking, reservations, electronic mails, internet and many more.
    [Show full text]
  • The Strange Birth and Long Life of Unix - IEEE Spectrum Page 1 of 6
    The Strange Birth and Long Life of Unix - IEEE Spectrum Page 1 of 6 COMPUTING / SOFTWARE FEATURE The Strange Birth and Long Life of Unix The classic operating system turns 40, and its progeny abound By WARREN TOOMEY / DECEMBER 2011 They say that when one door closes on you, another opens. People generally offer this bit of wisdom just to lend some solace after a misfortune. But sometimes it's actually true. It certainly was for Ken Thompson and the late Dennis Ritchie, two of the greats of 20th-century information technology, when they created the Unix operating system, now considered one of the most inspiring and influential pieces of software ever written. A door had slammed shut for Thompson and Ritchie in March of 1969, when their employer, the American Telephone & Telegraph Co., withdrew from a collaborative project with the Photo: Alcatel-Lucent Massachusetts Institute of KEY FIGURES: Ken Thompson [seated] types as Dennis Ritchie looks on in 1972, shortly Technology and General Electric after they and their Bell Labs colleagues invented Unix. to create an interactive time- sharing system called Multics, which stood for "Multiplexed Information and Computing Service." Time-sharing, a technique that lets multiple people use a single computer simultaneously, had been invented only a decade earlier. Multics was to combine time-sharing with other technological advances of the era, allowing users to phone a computer from remote terminals and then read e -mail, edit documents, run calculations, and so forth. It was to be a great leap forward from the way computers were mostly being used, with people tediously preparing and submitting batch jobs on punch cards to be run one by one.
    [Show full text]
  • The Strange Birth and Long Life of Unix - IEEE Spectrum
    The Strange Birth and Long Life of Unix - IEEE Spectrum http://spectrum.ieee.org/computing/software/the-strange-birth-and-long-li... COMPUTING / SOFTWARE FEATURE The Strange Birth and Long Life of Unix The classic operating system turns 40, and its progeny abound By WARREN TOOMEY / DECEMBER 2011 They say that when one door closes on you, another opens. People generally offer this bit of wisdom just to lend some solace after a misfortune. But sometimes it's actually true. It certainly was for Ken Thompson and the late Dennis Ritchie, two of the greats of 20th-century information technology, when they created the Unix operating system, now considered one of the most inspiring and influential pieces of software ever written. A door had slammed shut for Thompson and Ritchie in March of 1969, when their employer, the American Telephone & Telegraph Co., withdrew from a collaborative project with the Photo: Alcatel-Lucent Massachusetts Institute of KEY FIGURES: Ken Thompson [seated] types as Dennis Ritchie looks on in 1972, shortly Technology and General Electric after they and their Bell Labs colleagues invented Unix. to create an interactive time-sharing system called Multics, which stood for "Multiplexed Information and Computing Service." Time-sharing, a technique that lets multiple people use a single computer simultaneously, had been invented only a decade earlier. Multics was to combine time-sharing with other technological advances of the era, allowing users to phone a computer from remote terminals and then read e-mail, edit documents, run calculations, and so forth. It was to be a great leap forward from the way computers were mostly being used, with people tediously preparing and submitting batch jobs on punch cards to be run one by one.
    [Show full text]
  • Attachment A
    Board of Governors, State University System of Florida Request to Offer a New Degree Program (Please do not revise this proposal format without prior approval from Board staff) University of West Florida Fall 2018 University Submitting Proposal Proposed Implementation Term Hal Marcus College of Science and Engineering Computer Science Name of College(s) or School(s) Name of Department(s)/ Division(s) Bachelor of Science in Computer Computer Science Science Academic Specialty or Field Complete Name of Degree 11.0701 Proposed CIP Code The submission of this proposal constitutes a commitment by the university that, if the proposal is approved, the necessary financial resources and the criteria for establishing new programs have been met prior to the initiation of the program. Date Approved by the University Board of President Date Trustees Signature of Chair, Board of Date Provost and Senior Vice Date Trustees President Provide headcount (HC) and full-time equivalent (FTE) student estimates of majors for Years 1 through 5. HC and FTE estimates should be identical to those in Table 1 in Appendix A. Indicate the program costs for the first and the fifth years of implementation as shown in the appropriate columns in Table 2 in Appendix A. Calculate an Educational and General (E&G) cost per FTE for Years 1 and 5 (Total E&G divided by FTE). Projected Implementation Projected Program Costs Enrollment Timeframe (From Table 2) (From Table 1) E&G Contract E&G Auxiliary Total HC FTE Cost per & Grants Funds Funds Cost FTE Funds Year 1 150 96.87 3,241 313,960 0 0 313,960 Year 2 150 96.87 Year 3 160 103.33 Year 4 160 103.33 Year 5 170 109.79 3,426 376,087 0 0 376,087 1 Note: This outline and the questions pertaining to each section must be reproduced within the body of the proposal to ensure that all sections have been satisfactorily addressed.
    [Show full text]
  • The Circle Meta-Model
    Document:P2062R0 Revises: (original) Date: 01-11-2020 Audience: SG7 Authors: Wyatt Childers ([email protected]) ​ ​ Andrew Sutton ([email protected]) ​ ​ Faisal Vali ([email protected]) Daveed Vandevoorde ([email protected]) The Circle Meta-model Introduction During the November 2019 meeting in Belfast, some of the SG7 participants enthusiastically mentioned Circle1 as providing a more intuitive compile-time programming model and suggested that SG7 investigate overhauling the de-facto SG7 approach (P1240+P17332) to follow Circle's ​ ​ ​ general approach (to reflection and metaprogramming). This paper describes a framework for understanding metaprogramming systems and provides a high-level overview of some of Circle's main characteristics, contrasting them to P1240's ​ ​ approach augmented with an injection mechanism along the lines of P1717. ​ ​ While we appreciate some of Circle’s powerful capabilities, we also raise some concerns with its underlying model and provide arguments in support of P1240’s choices as being a more ​ ​ suitable fit for C++’s evolution. The Dimensions of Reflective Programming In P0633, we identified three “dimensions” of compile-time reflective metaprogramming: ​ ​ 1. Control: How are compile-time computations effected/interpreted? What are metaprograms? 2. Reflection: How are source constructs are made available as data for use in metaprograms? 3. Synthesis: How can “code” be generated from a programmatic representation? 1 https://www.circle-lang.org/ Circle is an impressive project: Sean Baxter developed a brand new ​ ​ C++17-like front end on top of LLVM, incorporating a variety of new compile-time capabilities that align closely with SG7's goals. For Sean’s motivations, see https://github.com/seanbaxter/circle/blob/master/examples/README.md#why-i-wrote-circle.
    [Show full text]
  • Comparative Studies of Programming Languages; Course Lecture Notes
    Comparative Studies of Programming Languages, COMP6411 Lecture Notes, Revision 1.9 Joey Paquet Serguei A. Mokhov (Eds.) August 5, 2010 arXiv:1007.2123v6 [cs.PL] 4 Aug 2010 2 Preface Lecture notes for the Comparative Studies of Programming Languages course, COMP6411, taught at the Department of Computer Science and Software Engineering, Faculty of Engineering and Computer Science, Concordia University, Montreal, QC, Canada. These notes include a compiled book of primarily related articles from the Wikipedia, the Free Encyclopedia [24], as well as Comparative Programming Languages book [7] and other resources, including our own. The original notes were compiled by Dr. Paquet [14] 3 4 Contents 1 Brief History and Genealogy of Programming Languages 7 1.1 Introduction . 7 1.1.1 Subreferences . 7 1.2 History . 7 1.2.1 Pre-computer era . 7 1.2.2 Subreferences . 8 1.2.3 Early computer era . 8 1.2.4 Subreferences . 8 1.2.5 Modern/Structured programming languages . 9 1.3 References . 19 2 Programming Paradigms 21 2.1 Introduction . 21 2.2 History . 21 2.2.1 Low-level: binary, assembly . 21 2.2.2 Procedural programming . 22 2.2.3 Object-oriented programming . 23 2.2.4 Declarative programming . 27 3 Program Evaluation 33 3.1 Program analysis and translation phases . 33 3.1.1 Front end . 33 3.1.2 Back end . 34 3.2 Compilation vs. interpretation . 34 3.2.1 Compilation . 34 3.2.2 Interpretation . 36 3.2.3 Subreferences . 37 3.3 Type System . 38 3.3.1 Type checking . 38 3.4 Memory management .
    [Show full text]
  • Sub-Method Structural and Behavioral Reflection Marcus Denker
    Sub-method Structural and Behavioral Reflection Marcus Denker To cite this version: Marcus Denker. Sub-method Structural and Behavioral Reflection. Computer Science [cs]. Universität Bern, 2008. English. tel-00555937 HAL Id: tel-00555937 https://tel.archives-ouvertes.fr/tel-00555937 Submitted on 14 Jan 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Sub-method Structural and Behavioral Reflection Inauguraldissertation der Philosophisch-naturwissenschaftlichen Fakultät der Universität Bern vorgelegt von Marcus Denker von Deutschland Leiter der Arbeit: Prof. Dr. O. Nierstrasz Institut für Informatik und angewandte Mathematik Von der Philosophisch-naturwissenschaftlichen Fakultät angenommen. Bern, 26.05.2008 Der Dekan: Prof. Dr. P. Messerli This dissertation is available as a free download from http://scg.unibe.ch Copyright © 2008 Marcus Denker. The contents of this dissertation are protected under Creative Commons Attribution-ShareAlike 3.0 Unported license. You are free: to Share — to copy, distribute and transmit the work to Remix — to adapt the work Under the following conditions: Attribution. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
    [Show full text]
  • Squinting at Power Series
    Squinting at Power Series M. Douglas McIlroy AT&T Bell Laboratories Murray Hill, New Jersey 07974 ABSTRACT Data streams are an ideal vehicle for handling power series. Stream implementations can be read off directly from simple recursive equations that de®ne operations such as multiplication, substitution, exponentiation, and reversion of series. The bookkeeping that bedevils these algorithms when they are expressed in traditional languages is completely hidden when they are expressed in stream terms. Communicating processes are the key to the simplicity of the algorithms. Working versions are presented in newsqueak, the language of Pike's ``squint'' system; their effectiveness depends critically on the stream protocol. Series and streams Power series are natural objects for stream processing. Pertinent computations are neatly describable by recursive equations. CSP (communicating sequential process) languages1, 2 are good vehicles for implementation. This paper develops the algorithmic ideas and reduces them to practice in a working CSP language,3 not coincidentally illustrating the utility of concurrent programming notions in untangling the logic of some intricate computations on sequences. This elegant approach to power series computation, ®rst demonstrated but never published by Kahn and MacQueen as an application of their data stream system, is still little known.4 Power series are represented as streams of coef®cients, the exponents being given implicitly by ordinal position. (This is an in®nite analogue of the familiar representation of a polynomial as an array of coef®cients.) Thus the power series for the exponential function ∞ 1 1 1 e x = Σ x n / n! = 1 + x + __ x 2 + __ x 3 + ___ x 4 + .
    [Show full text]
  • Uma Introdução À Computação: História E Ciência Editora Ixtlan - São Paulo – 2016
    São Paulo – 2016 Copyright © Autores diversos Projeto gráfico: Editora Ixtlan Revisão: Eduardo Telmo Fonseca Santos Milena Montenegro Pereira Diagramação: Márcia Todeschini Capa: Gabriel Polizello Uma introdução à computação: história e ciência Editora Ixtlan - São Paulo – 2016 ISBN: 978-85-8197-510-8 1.Ciência da computação 2.história CDD 000 Editora Ixtlan - CNPJ 11.042.574/0001-49 - I.E. 456166992117 [email protected] – www.editoraixtlan.com DIREITOS PRESERVADOS – É proibida a reprodução total ou parcial, de qualquer forma ou por qualquer meio. A violação dos direitos de autor (Lei Federal 9.610/1998) é crime previsto no art. 184 do Código Penal. Sumário 1. Início da computação - 3 2. Software - 19 3. Representação da Informação - 27 4. Ciência da Computação é Ciência? - 35 5. Rede de Computadores - 37 6. Exercícios Complementares - 49 7. Bibliografia - 53 Cap´ıtulo 1 Início da computação Para entender os fundamentos da computação atual é preciso olhar para o passado e ver como essa disciplina/área foi fundada e como vem se desenvolvendo até a atualidade [5]. Uma das bases da computação é a Matemática. Desde os primórdios o ser humano percebeu a necessidade de desenvolver algo para auxiliá-lo nas mais diversas operações. Essa necessidade é a responsável pelo surgimento desde as máquinas de calcular até as mais diversas máquinas utilizadas no mundo todo. Em torno de 2600 anos a.C., surgiu um dos primeiros instrumentos manuais voltados para ajudar o homem a calcular quantias numéricas. Esse instrumento usado para representação dos números era o ábaco chinês, que apesar do tempo em que surgiu, ainda é comumente utilizado em certas localidades.
    [Show full text]
  • Directly Reflective Meta-Programming
    Directly Reflective Meta-Programming ∗ Aaron Stump Computer Science and Engineering Washington University in St. Louis St. Louis, Missouri, USA [email protected] Abstract Existing meta-programming languages operate on encodings of pro- grams as data. This paper presents a new meta-programming language, based on an untyped lambda calculus, in which structurally reflective pro- gramming is supported directly, without any encoding. The language fea- tures call-by-value and call-by-name lambda abstractions, as well as novel reflective features enabling the intensional manipulation of arbitrary pro- gram terms. The language is scope safe, in the sense that variables can neither be captured nor escape their scopes. The expressiveness of the language is demonstrated by showing how to implement quotation and evaluation operations, as proposed by Wand. The language's utility for meta-programming is further demonstrated through additional represen- tative examples. A prototype implementation is described and evaluated. Keywords: lambda calculus, reflection, meta-programming, Church en- coding, Mogensen-Scott encoding, Wand-style fexprs, alpha equivalence, language implementation. 1 Introduction This paper presents a new meta-programming language called Archon, in which programs can operate directly on other programs as data. Existing meta- programming languages suffer from defects such as encoding programs at too low a level of abstraction, or in a way that bloats the encoded program terms. Other issues include the possibility for variables either to be captured or escape their static scopes. Archon rectifies these defects by trading the complexity of the reflective encoding for additional programming constructs. We adopt ∗This work is supported by funding from the U.S.
    [Show full text]
  • [Lirmm-00862477, V1] Bridging the Gap Between Component-Based Design and Implementation with a Reflective Programming Language
    Design and Implementation of a reflective Component-based programming and modeling language Bridging the Gap between Component-based Design and Implementation with a Reflective Programming Language Petr Spacek Christophe Dony Luc Fabresse Chouki Tibermacine Universite´ Lille Nord de France LIRMM, CNRS and Montpellier II University Ecole des Mines de Douai 161, rue Ada 941 rue Charles Bourseul 34392 Montpellier Cedex 5 France 59508 DOUAI Cedex France spacek,dony,tibermacin @lirmm.fr [email protected] { } Abstract General Terms Languages, Reflection, Metamodeling Component-based Software Engineering studies the design, Keywords Component, Programming, Modeling, Archi- development and maintenance of software constructed upon tecture, Reflection, Reflexive, Meta-model, Constraints, sets of connected components. Existing component-based Transformations models are frequently transformed into non-component- based programs, most of the time object-oriented, for run- time execution and then many component-related concepts, 1. Introduction e.g. explicit architecture, vanish at the implementation stage. Research works on component-based software engineering The main reason why is that with objects the component- (CBSE) have brought many advances on how to achieve related concepts are treated implicitly and therefore the orig- complex software development by reusing and assembling inal intentions and qualities of the component-based design components. The current trend is to explicitly express ar- are hidden. This paper presents a reflective component-based chitectures of software solutions, to reason about them, to programming and modeling language, which proposes the verify them and to transform them. However it appears following original contributions: 1) Components are seen that component-orientation has been more studied at de- as objects in which requirements, architecture descriptions, sign stage, with modeling languages and ADLs [10, 16, 22] connection points, etc.
    [Show full text]
  • Universidad Nacional Autónoma De México, Por Permitirme El Honor De Formar Parte De Ella
    Universidad Nacional Autónoma de México FACULTAD DE INGENIERÍA “SISTEMA DE MONITOREO DE SERVIDORES UNIX” T E S I S Que para obtener el Título de: INGENIERO EN COMPUTACIÓN P r e s e n t a: EDGAR CRISTÓBAL RAMÍREZ MIRANDA Director de Tesis: Ing. Noé Cruz Marín Agradecimientos Más que gracias, mi eterno amor a mi padre, mi madre y a mis hermanos a los cuales les debo lo que soy. Papá te admiro y respeto profundamente por la rectitud y honradez con la que te conduces a cada paso de tu vida, por el apoyo y dirección que siempre de ti he recibido, por todas las enseñanzas que desde chico recibí de ti y espero seguir recibiendo. Mamá te amo por todos los años de dedicación que me has dado, por los desvelos, por las lágrimas, por los cariños, por tu inmensa ternura y compasión, por que no encuentro ni encontraré jamás la forma de pagarte todo lo que me has dado, gracias. A mi hermano Emilio por ser mi amigo, por enseñarme a defenderme, por ser mi ídolo, por ensañarme a no desistir nunca hasta alcanzar las metas, porque a tu lado siempre me sentí protegido, por alentarme a ser ingeniero. A mi hermano Joaquín, por que de ti aprendí a ser más sereno a pensar antes de actuar, por siempre protegerme de todos sin importarte nada, por estar conmigo en las buenas y en las malas, por tu tolerancia, por ser mi amigo en los tiempos difíciles. Gracias por aguantarme, soportarme, cuidarme y quererme de la forma en la que lo hacen, estoy y siempre estaré orgulloso de pertenecer a la familia Ramírez Miranda.
    [Show full text]