Deep Instinct

Deep Instinct is a cybersecurity company that applies deep learning to cybersecurity. The company implements artificial intelligence to the task of preventing and detecting malware. The company was the recipient of the Technology Pioneer by The World Economic Forum in 2017. Lane Bess has been CEO of the company since 2022. == Overview == In 2015, Deep Instinct was founded by Guy Caspi, Dr. Eli David, and Nadav Maman. The headquarters of the company is located in New York City. In July 2017, NVIDIA became an investor. According to Tom's Hardware, NVIDIA’s investment enabled access to a GPU-based neural network and CUDA platform, which they were using to achieve maximum vulnerability detection rates. As of February 2020, the company had raised $43 million in Series C funding round. In April 2021, Deep Instinct raised $100 million in Series D funding to accelerate growth. == Partnerships == In April 2019, Deep Instinct partnered with Chinese artist, Guo O. Dong on an art project titled, The Persistence of Chaos, consisting of a laptop infected with 6 pieces of malware that represented $95 billion in damages. The art was auctioned with a final bid of $1,345,000. In the same year, Globes reported that, HP Inc partnered with Deep Instinct to launch their security solution HP SureSense, which has been applied to the EliteBook and Zbook devices.

Spleak

Spleak was an IM platform where users could publish and rate content. It existed in the form of six bots covering as many subject areas: CelebSpleak, SportSpleak, VoteSpleak, TVSpleak, GameSpleak, and StyleSpleak. == Overview == Users can add a "multi-Spleak" (which contains all of the different Spleak bots in one) or add the separate bots to their IM buddy lists on MSN and AIM. Users are also allowed access to Spleak online by using a CelebSpleak, SportSpleak, or VoteSpleak widget, or through the CelebSpleak and SportSpleak applications with Facebook. Spleak was an alternate reality game and is moving to its own company, Spleak Media Network. "Celebrate Spleak" was introduced throughout 2007, launched in 2008, and was forced to retire in 2009. == Key people == Spleak was co-founded by Morten Lund and Nicolaj Reffstrup. The company's chief executive officer is Morrie Eisenburg; Josh Scott is Vice President in Product and Tyler Wells is Vice President in Engineering.

Construction of t-norms

In mathematics, t-norms are a special kind of binary operations on the real unit interval [0, 1]. Various constructions of t-norms, either by explicit definition or by transformation from previously known functions, provide a plenitude of examples and classes of t-norms. This is important, e.g., for finding counter-examples or supplying t-norms with particular properties for use in engineering applications of fuzzy logic. The main ways of construction of t-norms include using generators, defining parametric classes of t-norms, rotations, or ordinal sums of t-norms. Relevant background can be found in the article on t-norms. == Generators of t-norms == The method of constructing t-norms by generators consists in using a unary function (generator) to transform some known binary function (most often, addition or multiplication) into a t-norm. In order to allow using non-bijective generators, which do not have the inverse function, the following notion of pseudo-inverse function is employed: Let f: [a, b] → [c, d] be a monotone function between two closed subintervals of extended real line. The pseudo-inverse function to f is the function f (−1): [c, d] → [a, b] defined as f ( − 1 ) ( y ) = { sup { x ∈ [ a , b ] ∣ f ( x ) < y } for f non-decreasing sup { x ∈ [ a , b ] ∣ f ( x ) > y } for f non-increasing. {\displaystyle f^{(-1)}(y)={\begin{cases}\sup\{x\in [a,b]\mid f(x)y\}&{\text{for }}f{\text{ non-increasing.}}\end{cases}}} === Additive generators === The construction of t-norms by additive generators is based on the following theorem: Let f: [0, 1] → [0, +∞] be a strictly decreasing function such that f(1) = 0 and f(x) + f(y) is in the range of f or in [f(0+), +∞] for all x, y in [0, 1]. Then the function T: [0, 1]2 → [0, 1] defined as T(x, y) = f (-1)(f(x) + f(y)) is a t-norm. Alternatively, one may avoid using the notion of pseudo-inverse function by having T ( x , y ) = f − 1 ( min ( f ( 0 + ) , f ( x ) + f ( y ) ) ) {\displaystyle T(x,y)=f^{-1}\left(\min \left(f(0^{+}),f(x)+f(y)\right)\right)} . The corresponding residuum can then be expressed as ( x ⇒ y ) = f − 1 ( max ( 0 , f ( y ) − f ( x ) ) ) {\displaystyle (x\Rightarrow y)=f^{-1}\left(\max \left(0,f(y)-f(x)\right)\right)} . And the biresiduum as ( x ⇔ y ) = f − 1 ( | f ( x ) − f ( y ) | ) {\displaystyle (x\Leftrightarrow y)=f^{-1}\left(\left|f(x)-f(y)\right|\right)} . If a t-norm T results from the latter construction by a function f which is right-continuous in 0, then f is called an additive generator of T. Examples: The function f(x) = 1 – x for x in [0, 1] is an additive generator of the Łukasiewicz t-norm. The function f defined as f(x) = –log(x) if 0 < x ≤ 1 and f(0) = +∞ is an additive generator of the product t-norm. The function f defined as f(x) = 2 – x if 0 ≤ x < 1 and f(1) = 0 is an additive generator of the drastic t-norm. Basic properties of additive generators are summarized by the following theorem: Let f: [0, 1] → [0, +∞] be an additive generator of a t-norm T. Then: T is an Archimedean t-norm. T is continuous if and only if f is continuous. T is strictly monotone if and only if f(0) = +∞. Each element of (0, 1) is a nilpotent element of T if and only if f(0) < +∞. The multiple of f by a positive constant is also an additive generator of T. T has no non-trivial idempotents. (Consequently, e.g., the minimum t-norm has no additive generator.) === Multiplicative generators === The isomorphism between addition on [0, +∞] and multiplication on [0, 1] by the logarithm and the exponential function allow two-way transformations between additive and multiplicative generators of a t-norm. If f is an additive generator of a t-norm T, then the function h: [0, 1] → [0, 1] defined as h(x) = e−f (x) is a multiplicative generator of T, that is, a function h such that h is strictly increasing h(1) = 1 h(x) · h(y) is in the range of h or equal to 0 or h(0+) for all x, y in [0, 1] h is right-continuous in 0 T(x, y) = h (−1)(h(x) · h(y)). Vice versa, if h is a multiplicative generator of T, then f: [0, 1] → [0, +∞] defined by f(x) = −log(h(x)) is an additive generator of T. == Parametric classes of t-norms == Many families of related t-norms can be defined by an explicit formula depending on a parameter p. This section lists the best known parameterized families of t-norms. The following definitions will be used in the list: A family of t-norms Tp parameterized by p is increasing if Tp(x, y) ≤ Tq(x, y) for all x, y in [0, 1] whenever p ≤ q (similarly for decreasing and strictly increasing or decreasing). A family of t-norms Tp is continuous with respect to the parameter p if lim p → p 0 T p = T p 0 {\displaystyle \lim _{p\to p_{0}}T_{p}=T_{p_{0}}} for all values p0 of the parameter. === Schweizer–Sklar t-norms === The family of Schweizer–Sklar t-norms, introduced by Berthold Schweizer and Abe Sklar in the early 1960s, is given by the parametric definition T p S S ( x , y ) = { T min ( x , y ) if p = − ∞ ( x p + y p − 1 ) 1 / p if − ∞ < p < 0 T p r o d ( x , y ) if p = 0 ( max ( 0 , x p + y p − 1 ) ) 1 / p if 0 < p < + ∞ T D ( x , y ) if p = + ∞ . {\displaystyle T_{p}^{\mathrm {SS} }(x,y)={\begin{cases}T_{\min }(x,y)&{\text{if }}p=-\infty \\(x^{p}+y^{p}-1)^{1/p}&{\text{if }}-\infty −∞ Continuous if and only if p < +∞ Strict if and only if −∞ < p ≤ 0 (for p = −1 it is the Hamacher product) Nilpotent if and only if 0 < p < +∞ (for p = 1 it is the Łukasiewicz t-norm). The family is strictly decreasing for p ≥ 0 and continuous with respect to p in [−∞, +∞]. An additive generator for T p S S {\displaystyle T_{p}^{\mathrm {SS} }} for −∞ < p < +∞ is f p S S ( x ) = { − log ⁡ x if p = 0 1 − x p p otherwise. {\displaystyle f_{p}^{\mathrm {SS} }(x)={\begin{cases}-\log x&{\text{if }}p=0\\{\frac {1-x^{p}}{p}}&{\text{otherwise.}}\end{cases}}} === Hamacher t-norms === The family of Hamacher t-norms, introduced by Horst Hamacher in the late 1970s, is given by the following parametric definition for 0 ≤ p ≤ +∞: T p H ( x , y ) = { T D ( x , y ) if p = + ∞ 0 if p = x = y = 0 x y p + ( 1 − p ) ( x + y − x y ) otherwise. {\displaystyle T_{p}^{\mathrm {H} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=+\infty \\0&{\text{if }}p=x=y=0\\{\frac {xy}{p+(1-p)(x+y-xy)}}&{\text{otherwise.}}\end{cases}}} The t-norm T 0 H {\displaystyle T_{0}^{\mathrm {H} }} is called the Hamacher product. Hamacher t-norms are the only t-norms which are rational functions. The Hamacher t-norm T p H {\displaystyle T_{p}^{\mathrm {H} }} is strict if and only if p < +∞ (for p = 1 it is the product t-norm). The family is strictly decreasing and continuous with respect to p. An additive generator of T p H {\displaystyle T_{p}^{\mathrm {H} }} for p < +∞ is f p H ( x ) = { 1 − x x if p = 0 log ⁡ p + ( 1 − p ) x x otherwise. {\displaystyle f_{p}^{\mathrm {H} }(x)={\begin{cases}{\frac {1-x}{x}}&{\text{if }}p=0\\\log {\frac {p+(1-p)x}{x}}&{\text{otherwise.}}\end{cases}}} === Frank t-norms === The family of Frank t-norms, introduced by M.J. Frank in the late 1970s, is given by the parametric definition for 0 ≤ p ≤ +∞ as follows: T p F ( x , y ) = { T m i n ( x , y ) if p = 0 T p r o d ( x , y ) if p = 1 T L u k ( x , y ) if p = + ∞ log p ⁡ ( 1 + ( p x − 1 ) ( p y − 1 ) p − 1 ) otherwise. {\displaystyle T_{p}^{\mathrm {F} }(x,y)={\begin{cases}T_{\mathrm {min} }(x,y)&{\text{if }}p=0\\T_{\mathrm {prod} }(x,y)&{\text{if }}p=1\\T_{\mathrm {Luk} }(x,y)&{\text{if }}p=+\infty \\\log _{p}\left(1+{\frac {(p^{x}-1)(p^{y}-1)}{p-1}}\right)&{\text{otherwise.}}\end{cases}}} The Frank t-norm T p F {\displaystyle T_{p}^{\mathrm {F} }} is strict if p < +∞. The family is strictly decreasing and continuous with respect to p. An additive generator for T p F {\displaystyle T_{p}^{\mathrm {F} }} is f p F ( x ) = { − log ⁡ x if p = 1 1 − x if p = + ∞ log ⁡ p − 1 p x − 1 otherwise. {\displaystyle f_{p}^{\mathrm {F} }(x)={\begin{cases}-\log x&{\text{if }}p=1\\1-x&{\text{if }}p=+\infty \\\log {\frac {p-1}{p^{x}-1}}&{\text{otherwise.}}\end{cases}}} === Yager t-norms === The family of Yager t-norms, introduced in the early 1980s by Ronald R. Yager, is given for 0 ≤ p ≤ +∞ by T p Y ( x , y ) = { T D ( x , y ) if p = 0 max ( 0 , 1 − ( ( 1 − x ) p + ( 1 − y ) p ) 1 / p ) if 0 < p < + ∞ T m i n ( x , y ) if p = + ∞ {\displaystyle T_{p}^{\mathrm {Y} }(x,y)={\begin{cases}T_{\mathrm {D} }(x,y)&{\text{if }}p=0\\\max \left(0,1-((1-x)^{p}+(1-y)^{p})^{1/p}\right)&{\text{if }}0

Anna Ridler

Anna Ridler (born 1985) is an artist who works with machine learning, handmade archives and moving image. She builds her own datasets to expose the labour and ideology embedded in the systems that organise knowledge. Her work is held in the permanent collections of the Whitney Museum of American Art, the Victoria and Albert Museum, M+ and ZKM Center for Art and Media Karlsruhe, and has been exhibited widely at cultural institutions including Tate Modern, Barbican Centre, Centre Pompidou, The Photographers' Gallery, Taipei Fine Arts Museum, MIT Museum, Kunsthaus Graz, ZKM Center for Art and Media Karlsruhe and Ars Electronica. == Biography == Born in London in 1985, Ridler spent her childhood raised between Atlanta, Georgia and the United Kingdom. She obtained a Bachelor of Arts in English Literature and Language from Oxford University in 2007 and a Master of Arts in Information Experience Design from the Royal College of Art in 2017. == Art practice == Ridler's practice uses technology, and in particular machine learning, to investigate how naming, classification and financial speculation determine what can be seen and what is erased. A core element of Ridler's work lies in the creation of handmade data sets through a laborious process of selecting and classifying images and text. By creating her own data sets, Ridler is able to uncover and expose underlying themes and concepts while also inverting the usual process of scraping pre-classified images found in large databases on the Internet. She began working with machine learning as an artistic material in 2017, at a moment when the technology required building every dataset by hand; that constraint became the foundation of the practice. Her interests are in drawing, machine learning, data collection, storytelling and technology. == Work == Some of Ridler's most notable works to date fall within her ‘tulip series’ which explores the hysteria around tulip mania and compares it to the speculation and bubbles surrounding cryptocurrencies. The series is expressed in three forms: a photographic dataset in Myriad (Tulips), 2018; two iterations of machine generated videos in Mosaic Virus (2018) and Mosaic Virus (2019); and a website with an accompanied functioning decentralized application in Bloemenveiling (2019). === Myriad (Tulips) (2018) === I wanted to draw together ideas around capitalism, value, and the tangible and intangible nature of speculation, and collapse from two very different yet surprisingly similar moments in history. Myriad (Tulips) (2018) is an installation of ten thousand hand-labeled photographs forming a dataset of unique tulips. The ten thousand, or myriad of, photographs were taken by Ridler over the course of three months, roughly the length of a tulip season, spent in Utrecht. Each photograph is carefully affixed one by one with magnets to a specially painted black wall in a laborious process to form a seemingly precise grid. Myriad (Tulips) (2018) has been exhibited in AI: More than Human, Barbican Centre, London, UK (May 16 - August 26, 2019); Error—The Art of Imperfection, Ars Electronica Export, Berlin, Germany (November 17, 2018 – March 3, 2019); Peer to Peer, Shanghai Centre of Photography, Shanghai, China (December 8 - February 9, 2020). The work was featured in Bloomberg, It’s Nice That, and Hyperallergic. For Myriad (Tulips), Ridler was nominated for a Beazley Design of the Year award for her presentation of an alternative perspective on how to engage with artificial intelligence; demonstrating a departure from ownership and control of major corporations to a more personalized process of constructing and conceptualizing from the ground-up. === Mosaic Virus (2018, 2019) === Mosaic Virus (2018) is a single screen video installation displaying a grid of continually evolving tulips in bloom. For Mosaic Virus (2019) Ridler used three screens. The appearance of the tulips is controlled by artificial intelligence using fluctuations in the price of bitcoin. The stripes on the tulips' petals reflect the value of the cryptocurrency. Ridler draws parallels with the tulip mania of the 17th century; representing the hysteria and speculation around crypto-currencies. The work takes its name from the mosaic virus which caused stripes in tulip petals, subsequently increasing their desirability and leading to speculative prices. Ridler trained a general adversarial network (GAN) on the set of ten thousand photographs of individual tulips from her work Myriad (Tulips). She used a technique called spectral normalization to improve the output. The work was exhibited in Error—The Art of Imperfection, Ars Electronica Export, Berlin, Germany (November 17, 2018 – March 3, 2019). === Bloemenveiling (2019) === Bloemenveiling (2019) is an auction of artificial-intelligence-generated tulips on the blockchain in the form of a functioning decentralized application: http://bloemenveiling.bid. Ridler collaborated with senior research scientist at DeepMind, David Pfau to investigate whether blockchain could be used as a means of finding poetic substance within it. The piece interrogates the way technology drives human desire and economic dynamics by creating artificial scarcity. In the work, short moving image pieces of tulips created by generative adversarial networks are sold at auction using smart contracts on the Ethereum network. Each time a tulip is sold, thousands of computers around the world all work to verify the transaction, checking each other's work against each other. While the artificial intelligence behind the moving image pieces has the potential to generate infinite flowers, the enormous distributed network is used, at great environmental cost, to introduce scarcity to an otherwise limitless resource. Bloemenveiling was exhibited in Entangled Realities, HEK Basel, Basel, Switzerland in 2019. == Solo exhibitions == Anna Ridler, Circadian Bloom, ZKM Center for Art and Media, Karlsruhe, (2023) Anna Ridler, Time Blooms, Buk Seoul Museum of Art, Seoul, (2025) Anna Ridler, Trace Remains, Galerie Nagel Draxler, Cologne, (2026) Anna Ridler, Laws of Ordered Form, The Photographers' Gallery, London (2020); The Abstraction of Nature, Aksioma, Ljubljana (2020) == Awards and recognition == European Union EMAP Fellow (2018) DARE Art Prize (2018–2019) Featured in Thames & Hudson, Digital Art (1960s–Now) Featured in British Art: The Last 15 Years ABS Digital Artist of the Year (2025)

Anytime algorithm

In computer science, an anytime algorithm is an algorithm that can return a valid solution to a problem even if it is interrupted before it ends. The algorithm is expected to find better and better solutions the longer it keeps running. Most algorithms run to completion: they provide a single answer after performing some fixed amount of computation. In some cases, however, the user may wish to terminate the algorithm prior to completion. The amount of computation required may be substantial, for example, and computational resources might need to be reallocated. Most algorithms either run to completion or they provide no useful solution information. Anytime algorithms, however, are able to return a partial answer, whose quality depends on the amount of computation they were able to perform. The answer generated by anytime algorithms is an approximation of the correct answer. == Names == An anytime algorithm may be also called an "interruptible algorithm". They are different from contract algorithms, which must declare a time in advance; in an anytime algorithm, a process can just announce that it is terminating. == Goals == The goal of anytime algorithms are to give intelligent systems the ability to make results of better quality in return for turn-around time. They are also supposed to be flexible in time and resources. They are important because artificial intelligence or AI algorithms can take a long time to complete results. This algorithm is designed to complete in a shorter amount of time. Also, these are intended to have a better understanding that the system is dependent and restricted to its agents and how they work cooperatively. An example is the Newton–Raphson iteration applied to finding the square root of a number. Another example that uses anytime algorithms is trajectory problems when you're aiming for a target; the object is moving through space while waiting for the algorithm to finish and even an approximate answer can significantly improve its accuracy if given early. What makes anytime algorithms unique is their ability to return many possible outcomes for any given input. An anytime algorithm uses many well defined quality measures to monitor progress in problem solving and distributed computing resources. It keeps searching for the best possible answer with the amount of time that it is given. It may not run until completion and may improve the answer if it is allowed to run longer. This is often used for large decision set problems. This would generally not provide useful information unless it is allowed to finish. While this may sound similar to dynamic programming, the difference is that it is fine-tuned through random adjustments, rather than sequential. Anytime algorithms are designed so that it can be told to stop at any time and would return the best result it has found so far. This is why it is called an interruptible algorithm. Certain anytime algorithms also maintain the last result, so that if they are given more time, they can continue from where they left off to obtain an even better result. == Decision trees == When the decider has to act, there must be some ambiguity. Also, there must be some idea about how to solve this ambiguity. This idea must be translatable to a state to action diagram. == Performance profile == The performance profile estimates the quality of the results based on the input and the amount of time that is allotted to the algorithm. The better the estimate, the sooner the result would be found. Some systems have a larger database that gives the probability that the output is the expected output. One algorithm can have several performance profiles. Most of the time performance profiles are constructed using mathematical statistics using representative cases. For example, in the traveling salesman problem, the performance profile was generated using a user-defined special program to generate the necessary statistics. In this example, the performance profile is the mapping of time to the expected results. This quality can be measured in several ways: certainty: where probability of correctness determines quality accuracy: where error bound determines quality specificity: where the amount of particulars determine quality == Algorithm prerequisites == Initial behavior: While some algorithms start with immediate guesses, others take a more calculated approach and have a start up period before making any guesses. Growth direction: How the quality of the program's "output" or result, varies as a function of the amount of time ("run time") Growth rate: Amount of increase with each step. Does it change constantly, such as in a bubble sort or does it change unpredictably? End condition: The amount of runtime needed

DAVI

The Dutch Automated Vehicle Initiative (DAVI) is a research and demonstration initiative developing automated vehicles for use on public roads. The project is unique in that, besides simply making driverless cars, it also focuses on having automated vehicles share information among each other. The aim is to have the cars help to avoid traffic congestion by reducing the safety distance between the cars (from 2 seconds to 0.5 seconds) and avoiding sudden traffic slow-downs due to maneuvers undertaken by drivers.

AI@50

AI@50, formally known as the "Dartmouth Artificial Intelligence Conference: The Next Fifty Years" (July 13–15, 2006), was a conference organized by James H. Moor, commemorating the 50th anniversary of the Dartmouth workshop which effectively inaugurated the history of artificial intelligence. Five of the original ten attendees were present: Marvin Minsky, Ray Solomonoff, Oliver Selfridge, Trenchard More, and John McCarthy. While sponsored by Dartmouth College, General Electric, and the Frederick Whittemore Foundation, a $200,000 grant from the Defense Advanced Research Projects Agency (DARPA) called for a report of the proceedings that would: Analyze progress on AI's original challenges during the first 50 years, and assess whether the challenges were "easier" or "harder" than originally thought and why Document what the AI@50 participants believe are the major research and development challenges facing this field over the next 50 years, and identify what breakthroughs will be needed to meet those challenges Relate those challenges and breakthroughs against developments and trends in other areas such as control theory, signal processing, information theory, statistics, and optimization theory. A summary report by the conference director, James H. Moor, was published in AI Magazine. == Conference Program and links to published papers == James H. Moor, conference Director, Introduction Carol Folt and Barry Scherr, Welcome Carey Heckman, Tonypandy and the Origins of Science === AI: Past, Present, Future === John McCarthy, What Was Expected, What We Did, and AI Today Marvin Minsky, The Emotion Machine === The Future Model of Thinking === Ron Brachman and Hector Levesque, A Large Part of Human Thought David Mumford, What is the Right Model for 'Thought'? Stuart Russell, The Approach of Modern AI === The Future of Network Models === Geoffrey Hinton & Simon Osindero, From Pandemonium to Graphical Models and Back Again Rick Granger, From Brain Circuits to Mind Manufacture === The Future of Learning & Search === Oliver Selfridge, Learning and Education for Software: New Approaches in Machine Learning Ray Solomonoff, Machine Learning — Past and Future Leslie Pack Kaelbling, Learning to be Intelligent Peter Norvig, Web Search as a Product of and Catalyst for AI === The Future of AI === Rod Brooks, Intelligence and Bodies Nils Nilsson, Routes to the Summit Eric Horvitz, In Pursuit of Artificial Intelligence: Reflections on Challenges and Trajectories === The Future of Vision === Eric Grimson, Intelligent Medical Image Analysis: Computer Assisted Surgery and Disease Monitoring Takeo Kanade, Artificial Intelligence Vision: Progress and Non-Progress Terry Sejnowski, A Critique of Pure Vision === The Future of Reasoning === Alan Bundy, Constructing, Selecting and Repairing Representations of Knowledge Edwina Rissland, The Exquisite Centrality of Examples Bart Selman, The Challenge and Promise of Automated Reasoning === The Future of Language and Cognition === Trenchard More The Birth of Array Theory and Nial Eugene Charniak, Why Natural Language Processing is Now Statistical Natural Language Processing Pat Langley, Intelligent Behavior in Humans and Machines === The Future of the Future === Ray Kurzweil, Why We Can Be Confident of Turing Test Capability Within a Quarter Century George Cybenko, The Future Trajectory of AI Charles J. Holland, DARPA's Perspective === AI and Games === Jonathan Schaeffer, Games as a Test-bed for Artificial Intelligence Research Danny Kopec, Chess and AI Shay Bushinsky, Principle Positions in Deep Junior's Development === Future Interactions with Intelligent Machines === Daniela Rus, Making Bodies Smart Sherry Turkle, From Building Intelligences to Nurturing Sensibilities === Selected Submitted Papers: Future Strategies for AI === J. Storrs Hall, Self-improving AI: An Analysis Selmer Bringsjord, The Logicist Manifesto Vincent C. Müller, Is There a Future for AI Without Representation? Kristinn R. Thórisson, Integrated A.I. Systems === Selected Submitted Papers: Future Possibilities for AI === Eric Steinhart, Survival as a Digital Ghost Colin T. A. Schmidt, Did You Leave That 'Contraption' Alone With Your Little Sister? Michael Anderson & Susan Leigh Anderson, The Status of Machine Ethics Marcello Guarini, Computation, Coherence, and Ethical Reasoning