An Early Program Proof by Alan Turing

1984 ◽  
Vol 6 (2) ◽  
pp. 139-143 ◽  
Author(s):  
F.L. Morris ◽  
C.B. Jones
Keyword(s):  
Alan Turing ◽  
Program Proof

Os jogos de tabuleiro e a construção do pensamento computacional em sala de aula

Temática ◽  
2018 ◽  
Vol 14 (11) ◽  
Author(s):  
Marcos Nicolau ◽  
Lucas Pimentel
Keyword(s):  
Alan Turing

Os jogos de tabuleiro existem há mais de 5 mil anos (Senet, Egito Antigo); sua longa existência têm sido co-participe na construção da linguagem computacional, com Charles Babbage, no século XVII, e com Alan Turing e Edward Thorp, no século XX. Eles permitem uma representação operacional que serve de analogia ao pensamento computacional. Se o sistema educacional brasileiro não fornece, nas Escolas Públicas, acesso satisfatório à informática aos seus alunos a partir dos conhecimentos de computação, por que não utilizar os jogos de tabuleiro em seus processos de criação, elaboração e jogabilidade, como forma de desenvolvimento do pensamento computacional a ser desenvolvido em sala de aula?Palavras-chave: Jogos de tabuleiro. Pensamento Comunicacional. Sala de aula.

Alan Turing

ACM Inroads ◽  
2012 ◽  
Vol 3 (3) ◽  
pp. 32-33
Author(s):  
Peter B. Henderson
Keyword(s):  
Alan Turing

scholarly journals Frühe digitale Poesie

2021 ◽  
Vol 44 (1) ◽  
pp. 11-18
Author(s):  
Toni Bernhart ◽  
Sandra Richter
Keyword(s):  
Künstliche Intelligenz ◽  
Alan Turing

ZusammenfassungDie Idee, Poesie maschinell zu generieren, ist so alt wie die Maschinen selbst. Sie lässt sich seit dem Mittelalter beobachten und setzt sich fort bis in die Gegenwart, in der Storytelling-Experimente Algorithmen zur natürlichsprachigen Textgenerierung (NLG) nutzen. Die weltweit ersten Versuche, Poesie digital herzustellen, gelangen in den 1950er Jahren den Mathematikern Christopher Strachey (1916–1975) in Manchester und Theo Lutz (1932–2010) in Stuttgart. Durch zufallsmäßige Auswahl passfähiger Wörter und Sätze erzeugte Strachey 1952 auf einer Ferranti Mark I kurze Liebesbriefe. Dazu verwendete er das Programmierhandbuch von Alan Turing (1912–1954). Daneben schrieb Strachey Programme für das Dame-Spiel und zur computationellen Erzeugung von Musik. Lutz stellte 1959 mithilfe eines Programms im Freiburger Code auf einer Zuse Z 22 seine Stochastischen Texte her, wofür er Wortmaterial aus Franz Kafkas Roman Das Schloss (1926) verwendete und wobei er mit dem Philosophen Max Bense (1910–1990) und dem späteren Informatik-Pionier Rul Gunzenhäuser (1933–2018) kooperierte. Weil Lutz’ Arbeitsunterlagen nahezu vollständig erhalten und im Deutschen Literaturarchiv Marbach für die Forschung zugänglich sind, gilt Lutz als ein literatur- und informatikgeschichtlich bedeutsamer Vertreter früher digitaler Poesie, die lange Zeit fast nur in avantgardistischen Zirkeln diskutiert wurde und kaum den Weg in eine breitere Öffentlichkeit fand. Erst aktuelle Debatten um sogenannte Künstliche Intelligenz (KI) lenken wieder die Aufmerksamkeit auf diese frühen Experimente, die ein faszinierender Mosaikstein der Technik‑, Kultur- und Literaturgeschichte sind.

Book Interview: In pursuit of the real Alan Turing

2015 ◽  
Vol 10 (11) ◽  
pp. 90-91
Author(s):  
N. Smith
Keyword(s):  
The Real ◽  
Alan Turing

What Is Living and What Is Dead in Classic European Philosophy of Technology?

2021 ◽  
Author(s):  
Carl Mitcham
Keyword(s):  
Martin Heidegger ◽  
Industrial Revolution ◽  
Philosophy Of Technology ◽  
Modern Technology ◽  
Alan Turing ◽  
The World ◽  
European Philosophy ◽  
Jacques Ellul ◽  
Philosophical Project

Classic European philosophy of technology is the original effort to think critically rather than promotionally about the historically unique mutation that is anchored in the Industrial Revolution and has since progressively transformed the world and itself. Three representative contributions to this pivotal philosophical project can be found in texts by Alan Turing, Jacques Ellul, and Martin Heidegger. Despite having initiated analytic, sociological, and phenomenological approaches to philosophy of technology, respectively, all three are often treated today in a somewhat patronizing manner. The present chapter seeks to revisit and reconsider their contributions, arguing that, especially in the case of Ellul and Heidegger, what is commonly dismissed as their overgeneralizations about modern technology as a whole might reasonably be of continuing relevance to contemporary students in the philosophy of technology.

A TYPE-FREE THEORY OF HALF-MONOTONE INDUCTIVE DEFINITIONS

1995 ◽  
Vol 06 (03) ◽  
pp. 203-234 ◽  
Author(s):  
YUKIYOSHI KAMEYAMA
Keyword(s):  
Type Theory ◽  
Characteristic Point ◽  
Logical Theory ◽  
Inductive Definition ◽  
Program Extraction ◽  
First Order ◽  
Inductive Definitions ◽  
Free Theory ◽  
Program Proof ◽  
Definition Of

This paper studies an extension of inductive definitions in the context of a type-free theory. It is a kind of simultaneous inductive definition of two predicates where the defining formulas are monotone with respect to the first predicate, but not monotone with respect to the second predicate. We call this inductive definition half-monotone in analogy of Allen’s term half-positive. We can regard this definition as a variant of monotone inductive definitions by introducing a refined order between tuples of predicates. We give a general theory for half-monotone inductive definitions in a type-free first-order logic. We then give a realizability interpretation to our theory, and prove its soundness by extending Tatsuta’s technique. The mechanism of half-monotone inductive definitions is shown to be useful in interpreting many theories, including the Logical Theory of Constructions, and Martin-Löf’s Type Theory. We can also formalize the provability relation “a term p is a proof of a proposition P” naturally. As an application of this formalization, several techniques of program/proof-improvement can be formalized in our theory, and we can make use of this fact to develop programs in the paradigm of Constructive Programming. A characteristic point of our approach is that we can extract an optimization program since our theory enjoys the program extraction theorem.

Alan Turing

2013 ◽  
pp. 251-257
Author(s):  
Gerard O’Regan
Keyword(s):  
Alan Turing
Sign in / Sign up

Export Citation Format

Share Document