
	Where results make sense

Topic: Interactive computation

Related Topics

Computability logic

Game semantics

Intuitionistic logic

Game theory

Walter Kohn

1698 in science

SVD Dragunov

History of economic thought

Political science

Trader Ethic

Hugh McCulloch

Volkswagen Polo

Capitalism

Theory of Games and Economic Behavior

Machiavelli

In the News (Thu 26 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Interactive computation (Site not responding. Last check: 2007-11-07)
		This is incontrast to the traditional understanding of computation which assumes asimple interface between a computing agent and its environment, consisting in asking a question (input) and generating an answer(output).
		While this fact has been admitted by Turing himself, it was not untilrecently that the theoretical computer science community realized the necessity to define adequate mathematical models ofinteractive computation.
		Among the currently studied mathematical models of computation that attempt to capture interaction are Japaridze 's hard- and easy-play machines elaboratedwithin the framework of computability logic, Goldin 's persistent Turing machines, Gurevich 's abstract state machines.
	www.therfcc.org /interactive-computation-33525.html (190 words)

	Interactive computation -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-11-07)
		This is in contrast to the traditional understanding of (Problem solving that involves numbers or quantities) computation which assumes a simple interface between a computing agent and its environment, consisting in asking a question (input) and generating an answer (output).
		While this fact has been admitted by (English mathematician who conceived of the Turing machine and broke German codes during World War II (1912-1954)) Alan Turing himself, it was not until recently that the theoretical computer science community realized the necessity to define adequate mathematical models of interactive computation.
		Among the currently studied mathematical models of computation that attempt to capture interaction are 's hard- and easy-play machines elaborated within the framework of (Click link for more info and facts about computability logic) computability logic, 's persistent Turing machines, 's abstract state machines.
	www.absoluteastronomy.com /encyclopedia/i/in/interactive_computation.htm (277 words)

	Interactive computation Article, Interactivecomputation Information (Site not responding. Last check: 2007-11-07)
		While this fact has been admitted by Alan Turing himself, itwas not until recently that the theoretical computer science community realized the necessity to define adequate mathematicalmodels of interactive computation.
		Among the currently studied mathematical models of computation that attempt to captureinteraction are Japaridze 's hard- and easy-play machines elaborated within theframework of computability logic, Goldin 's persistent Turing machines, Gurevich 's abstract state machines.
		interactiv computation, turing, interactive comptuation, logic, interactive computatoin, pp, interactive computtaion, abstract, interactive copmutation, theoretical, interactive comptation, answer, interactive computatino, goldin, interactive computatin, persistent, interactive comuptation, question, interacive computation, mathematical, interactive computatio, models, inteactive computation, hard,, currently, interactive coputation, mathematicalmodels, interactive ocmputation, foundations, interactive cmputation, necessity, iteractive computation, define, interactive compuattion, notes, interactive...
	www.anoca.org /computability/turing/interactive_computation.html (269 words)

	Interactive computation - Wikipedia, the free encyclopedia
		Among the currently studied mathematical models of computation that attempt to capture interaction are Japaridze's hard- and easy-play machines elaborated within the framework of computability logic, Goldin's persistent Turing machines, Gurevich's abstract state machines.
		D.Q.Goldin, Persistent Turing Machines as a model of interactive computation.
		This page was last modified 21:39, 17 October 2005.
	en.wikipedia.org /wiki/Interactive_computation (208 words)

	Encyclopedia: Interactive computation
		Among the currently studied mathematical models of computation that attempt to capture interaction are Japaridze
		D.Q.Goldin (http://www.cse.uconn.edu/~dqg/), Persistent Turing Machines as a model of interactive computation.
		Click for other authoritative sources for this topic (summarised at Factbites.com).
	www.nationmaster.com /encyclopedia/Interactive-computation (263 words)

Try your search on: Qwika (all wikis)