art+of+computation

  • 121Raymond Kurzweil — Infobox Person name = Raymond Kurzweil image size = 250px caption = Raymond Kurzweil birth date = Birth date and age|1948|2|12|mf=y birth place = Queens, New York, United States death date = death place = height = 5 7 weight = 145 lbs occupation …

    Wikipedia

  • 122Artificial life — Alife redirects here. For the Italian comune, see Alife, Campania. This article is about a field of research. For artificially created life forms, see synthetic life. For the mobile games developer, see Artificial Life Inc. Artificial life… …

    Wikipedia

  • 123Jürgen Schmidhuber — (born 1963 in Munich) is a computer scientist and artist known for his work on machine learning, universal Artificial Intelligence (AI), artificial neural networks, digital physics, and low complexity art. His contributions also include… …

    Wikipedia

  • 124Asymptotology — articleissues essay = September 2008 sections = September 2008 technical = September 2008 citations = September 2008Asymptotology – is the art of handling with applied mathematical systems in limiting cases (M.Kruskal); is the science about the… …

    Wikipedia

  • 125Georgische Grammatik — Dieser Artikel beschreibt die Grammatik der georgischen Sprache (Eigenbezeichnung: [kartuli ena] ქართული ენა). Die Grammatik des Georgischen und der anderen sogenannten kaukasischen Sprachen ist so umfangreich, dass hier keineswegs alle… …

    Deutsch Wikipedia

  • 126Atanasoff–Berry Computer — The Atanasoff–Berry Computer (ABC) was the first electronic digital computing device. [Citation | date = 1976 | editor last = Ralston | editor first = Anthony | editor2 last = Meek | editor2 first = Christopher | title = Encyclopedia of Computer… …

    Wikipedia

  • 127Cognitive science — Figure illustrating the fields that contributed to the birth of cognitive science, including linguistics, education, neuroscience, artificial Intelligence, philosophy, anthropology, and psychology. Adapted from Miller, George A (2003). The… …

    Wikipedia

  • 128Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …

    Wikipedia