Social Icons

Pages

5th Workshop on Logical and Semantic Frameworks, with Applications

Call for Papers

Scope

Logical and semantic frameworks are formal languages used to represent
logics, languages and systems. These frameworks provide foundations
for formal specification of systems and programming languages,
supporting tool development and reasoning.

The objective of this one-day workshop is to put together
theoreticians and practitioners to promote new techniques and results,
from the theoretical side, and feedback on the implementation and use
of such techniques and results, from the practical side. In this fifth
edition, the workshop will be in August the first, jointly with ICTAC
(http://www.iist.unu.edu/ICTAC/ictac2010/) in Natal-Rn, Brasil.

Topics of interest to this forum include, but are not limited to:

* Logical frameworks
* Proof theory
* Type theory
* Automated deduction
* Semantic frameworks
* Specification languages and meta-languages
* Formal semantics of languages and systems
* Computational and logical properties of semantic frameworks
* Implementation of logical and/or semantic frameworks
* Applications of logical and/or semantic frameworks

LSFA'10 also aims to be a forum for presenting and discussing work in
progress, and therefore to provide feedback to authors on their
preliminary research. Submissions to the workshop will in the form of
full papers. The proceedings are produced only after the meeting, so
that authors can incorporate this feedback in the published
papers. The publication of LSFA proceedings is planned to be a volume
of ENTCS (under consideration by ENTCS editorial board). Selected
papers, will be published in a special volume by ISTE
(http://www.iste.co.uk/)



Program Committee

* Flávio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil)
* Luis Farinas del Cerro (Program co-chair, IRIT, France)
* Edward Hermann Haeusler (Program co-chair, PUC-Rio, Brasil)
* Jonathan Seldin (Univ-Lethbridge , Canada) TBC
* Maurício Ayala-Rincón (UnB, Brasil)
* Christiano de Oliveira Braga (UFF, Brasil)
* Mario Benevides (Coppe-UFRJ, Brasil)
* Eduardo Bonelli ( UNLP, Argentina)
* Marcelo Corrêa (IM-UFF, Brasil)
* Clare Dixon (Liverpool, UK)
* Gilles Dowek (Polytechnique-Paris, France)
* William Farmer (Mcmaster, Canada)
* Maribel Fernández (King's College, UK)
* Marcelo Finger (IME-USP, Brasil)
* Fairouz Kamareddine (Heriot-Watt Univ, UK)
* Delia Kesner (Paris-Jussieu, France)
* Luis da Cunha Lamb (UFRGS, Brasil)
* Joao Marcos (UFRN, Brasil)
* Ana Teresa Martins (UFC, Brasil)
* Martin Musicante (UFRN, Brasil)
* Cláudia Nalon (UnB, Brasil)
* Luca Paolini (Universitá di Torino, Italy)
* Elaine Pimentel (UFMG, Brasil)

Important dates:

* Submission 31th May 2010
* Author's notification 1st July
* Camera-ready: 30th July
* Workshop : 31 August

Contributions should be written in English and submitted in the form
full papers with at most 16 pages. They must be unpublished and not
submitted simultaneously for publication elsewhere. The submission
should be in the form of a PDF file uploaded to LSFA2010 page at
EasyChair(https://www.easychair.org/account/signin.cgi?conf=lsfa10)
until the submission deadline by midnight, Central European Standard
Time (GMT+1).

The papers should be prepared in latex using Elsevier ENTCS
style. Please see the Instructions for Preparing Files for Preliminary
Versions Instructions for styles and examples. Instructions and the
Latex package used to format your submission can be found in
http://www.entcs.org/prelim.html

Organizing Committee

* Flávio Leonardo Cavalcanti de Moura (General Chair, UnB-Brasil)
* Martin Musicante (UFRN, Brasil)
* Edward Hermann Haeusler (PUC-Rio, Brasil)
* Cláudia Nalon (UnB, Brasil)
* Marcelo Corrêa (IM-UFF, Brasil)

Site Pessoal

LaTeX: A guide for philosophers

LaTeX is a fantastic tool for philosophers of all stripes - though it excels at typesetting the complicated formulas of logicians, it has distinct advantages for all philosophers. (I discuss some of these here. ) If you are here, I assume you want to learn how to use LaTeX. You can find vast amounts of information on LaTeX online. But this is not entirely helpful. Much of it is written for scientists; most of it is written by people who are very capable technologically. While there are certainly philosophers who are technically inclined, comfortable with using the command line and/or writing code, etc., most of us are not. This is a guide to using LaTeX for those who either are not technologically inclined or who do not have the time to poke around and figure everything out on their own.

LaTeX can seem overwhelming and complex. It needn’t be. There are three basic steps to producing your first LaTeX document. If you want to stop there, you will reap (practically) all the benefits of LaTeX. If you want to go further, it seems there is no end to the amount you can learn. My objective in these pages is to get you to a workable understanding of LaTeX with a minimum effort (on your part). After reading these pages, you should know how to write all your papers using LaTeX. If you want to jump ahead, click on the next page below. If you would like to know a bit more about LaTeX before we begin, read on.

Writing a paper in LaTeX is more complicated than writing a paper in a word processor in two ways. First, you have to be more explicit using LaTeX than you would with a word processor. Second, there are a few steps between typing the words on your keyboard and producing a finished document in LaTeX, not so with a word processor.

LaTeX is, in the first instance, a markup language. So when you ‘write a paper in LaTeX’, what you are really doing is creating a plain text file (with a .tex extension–so paper.tex, for example) filled with your content and some explicit instructions. The basic instructions are not that complicated, and your text editor will help you write them, but you do have to be explicit about inserting them.

The instructions you write in that plain text file are used in the steps between typing the paper and producing a finished product. Once you have a file, you run it through LaTeX. This is the step of compiling your paper, turning it from a plain text file into a PDF. (Note, there is the option to turn your paper into a .dvi file. I am certain there is some reason to want to do this. But I know that I have never had such a reason, and I bet you will be like me in this regard, so I will ignore that here.) All the little bits of code you explicitly insert into your paper are instructions that LaTeX uses to translate the .tex file into a .pdf file.

Writing a paper in a word processor is kind of like a packaged cupcake. All the formatting work is done for you. Writing a paper in LaTeX is kind of like baking a cake: you mix up raw ingredients and you don’t have anything very special–you have a sort of ugly plain text file full of code that, were you to print, would be confusing to someone who didn’t know LaTeX. But just as you have to put a cake in the oven to produce delicious goodness, so too must you put your .tex file through a process to get out the typesetting-goodness that is a LaTeX document.

If you do not already have a TeX distribution on your system, click here to continue; if you do have a TeX distribution, click here. (If you don’t know if you have a TeX distribution, look at the applications or programs on your computer. If you have a Mac and see TeXShop, or if you have a PC and see TeXworks or TeXnicCenter, then you have a TeX distribution installed.)

Fontes: http://www.charlietanksley.net/latex/

Site Pessoal

O Pensamento Matemático e as Ciências

palestra ( do Prof. Hersh) que está no ciclo de Conferências *O
Pensamento Matemático e as Ciências*, organizada pelo IMECC.

Esta palestra, em particular, será no Auditório 2 do *IFCH*, no dia 6 de
maio às 16h00 e seu título é o mesmo que o deste livro dele: *What is
Mathematics, really?*

http://www.amazon.com/What-Mathematics-Really-Reuben-Hersh/dp/0195130871

A graduação do Prof. Hersh foi em Literatura em Harvard e depois ele foi
para o Courant na NYU para o PhD em Matemática com Peter Lax.

Talvez vocês se lembrem do Prof. Hersh pelos seus artigos expositórios
(inclusive no Scientific American, e no Mathematical Intelligencer).

Site Pessoal

John Venn



Lógico e matemático britânico nascido em Hull, Inglaterra, criador dos diagramas de Venn adotados pela matemática modena. Procedente da Low Church Evangelical, estudou e graduou-se no Gonville and Caius College, parte da Universidade de Cambridge (1853-1857), foi eleito fellow e, dois anos depois, ordenado padre (1859). Cura em Mortlake, voltou para a Universidade de Cambridge (1862) como um lecturer em Ciência Moral, estudando e ensinando lógica pedagógica e teoria de probabilidade, e nesta cidade permaneceu até sua morte. Desenvolveu e ampliou a lógica matemática de George Boole, tornando-se conhecido pelos seus diagramas para representar uniões e interseções entre conjuntos. Escreveu Logic of Chance (1866) que Keynes descreveu como notavelmente original e que influenciou o desenvolvimento da teoria de estatísticas. Na teoria de probabilidade, ficou mais conhecido pelos diagramas esquemáticos, conhecidos como diagramas de Venn que são usados para ilustrar operações com conjuntos. Deixou a Igreja (1870) e depois publicou Symbolic Logic (1881), seu mais duradouro trabalho em lógica, e The Principles of Empirical Logic (1889). Eleito fellow da Royal Society (1883), aproximadamente nesta época sua carreira mudou direção, passando a demonstrar interesse por história. Escreveu uma história sobre sua faculdade e publicou The Biographical History of Gonville and Caius College 1349-1897 (1897). Empreendeu, então, a imensa tarefa de compilar uma história da Universidade de Cambridge na qual foi ajudado pelo filho e, em vida só conseguiu publicar o primeiro volume deste monumental empreendimento (1922). Também teve outras habilidades e interesses, inclusive uma habilidade rara para inventar máquinas, como a que criou para fazer rolar bolas de cricket que fez grande sucesso quando o time de cricket australiano visitou Cambridge (1909). Morreu em Cambridge e entre outros livros matemáticos publicados por ele incluem-se Logic of Chance (1866), Symbolic Logic (1881) e The Principles of Empirical Logic (1889). Particularmente também se interessou apaixonadamente pela história da Universidade de Cambridge e escreveu The Biographical History of Gronville and Caius College 1349-1897 (1897) e também começou um projeto muito mais ambicioso para escrever a história da universidade inteira.

fonte: http://www.dec.ufcg.edu.br/biografias/JohnVenn.html

Site Pessoal

Second Brazilian Workshop of the Game Theory Society

in Honor of John Nash, on the occasion of the 60th anniversary of Nash Equilibrium


General Information

ORGANIZER

It is a great pleasure to invite you to participate in the SECOND BRAZILIAN WORKSHOP OF THE GAME THEORY SOCIETY, the 1st São Paulo School of Advanced Sciences on Game Theory of FAPESP - The State of São Paulo Research Foundation. It will be held at the University of São Paulo, from July 29 to August 4, 2010. The event will honor JOHN NASH, on the occasion of the 60th anniversary of Nash equilibrium.

The workshop will offer the participants the opportunity to interact with some of the most productive researchers in Game Theory. The week-long event will consist of conferences, contributed papers sessions and mini-courses which will start at the introductory level and will reach the frontiers of current research. All graduate students should send a recommendation letter from their supervisors to bwgt2010@usp.br.



Undergraduate students may register. A letter of recommendation is also required. The recommendation letter must be written by a professor from the student´s institution. Acceptance results will be announced by April 15. We recommend all graduate and undergraduate students to pay the registration fee after the acceptance decisions are announced.

Limited funds are available. See the application rules for financial support.


DEADLINES
Early Registration: 03/30/2010

Extended abstract: 03/30/2010
Acceptance: 04/30/2010

Registration fee payment: 05/15/2010


DEAR APPLICANTS, DUE TO SPACE LIMITATIONS WE ARE UNABLE TO TAKE NEW REGISTRATIONS.
ORGANIZING COMMITTEE.

SCIENTIFIC ORGANIZER
Marilda Sotomayor, Universidade de São Paulo/SP, Brazil.
LOCAL ORGANIZER COMMITTEE
Marilda Sotomayor, Universidade de São Paulo/SP, Brazil.
Maurício Bugarin, Insper/SP, Brazil.
Adhemar Villani Junior, Insper/SP, Brazil.
Gustavo Andrey, Universidade de São Paulo/SP, Brazil.
Joe Yoshino, Universidade de São Paulo/SP, Brazil.

PROGRAM COMMITTEE

Chair: Marilda Sotomayor, Universidade de São Paulo/SP, Brazil
M. Bugarim, Insper/SP, Brazil

M. Nunez, Universidad de Barcelona, Spain
S. Brams, New York University, USA

A. Sandroni, University of Pennsylvania, USA
G. De Clippel, Brown University, USA

A. Urbano, Universidad de Valencia, Spain
O. Gossner, Paris School of Economics, FR and London School of Economics, UK

F. Valenciano, Universidad Del País Vasco, Spain
W. Maldonado, Universidade Católica de Brasília/DF, Brazil

B. Von Stengel, London School of Economics, UK
P. Milgrom, Stanford University, USA - www.milgrom.net

J. Wooders, University of Arizona, USA
H. Moulin, Rice University, USA

M. Wooders, Vanderbilt University, USA


INVITED SPEAKERS:

John Nash (Nobel Prize in Economics of 1994)
Robert Aumann (Nobel Prize in Economics of 2005)
Roger Myerson (Nobel Prize in Economics of 2007)
Eric Maskin (Nobel Prize in Economics of 2007)
A. Araujo, IMPA e FGV/RJ,BR

G. De Clippel, Brown Univ., USA
G. Demange, Paris School of Econ., FR

J. Duggan, Univ. of Rochester, USA
P. Dubey, SUNY at Stony Brook, USA

O. Gossner, PSE, FR and LSE, UK
S. Hart, Hebrew Univ. of Jerusalem, IL

O. Hudry, ENS des Télécon., FR
A. Neyman, Hebrew Univ. of Jerusalem, IL

H. Moreira, FGV - EPGE
M. Perry, Hebrew Univ. of Jerusalem, IL and Univ. of Warwick, UK

M. Nunez, Univ. Barcelona, Spain
P. Reny, Univ. of Chicago, USA

F. Page, Univ. of Alabama, USA
W. Thomson, Univ. of Rochester, USA

H. Sabourian, Univ. of Cambridge, USA
M. Wooders, Vanderbilt Univ., USA

W. Sandholm, Univ. of Wisconsin, USA

A. Sandroni, Univ. of Pennsylvania, USA

A. Urbano, Univ. de Valencia, Spain

F. Valenciano, Univ. Del País Vasco, Spain


MINI-COURSES
Non-Cooperative Games, Shmuel Zamir, Hebrew Univ. of Jerusalem,Israel.
Auction Theory, Paul Milgrom, Stanford Univ., USA.
Experimental Economics, John Wooders, Univ. of Arizona, USA.
Game Theory and Democracy, Steven Brams, New York Univ., USA.
Networks, Matthew Jackson, Stanford Univ., USA.
Stochastic Games: Algorithms and Existence Theorems, T.E.S. Raghavan, Univ. of Illinois at Chicago, USA.

Fonte: http://aplicativos.fipe.org.br/bwgt2010/index.htm

Site Pessoal

The ECAI-10 Workshop

CALL FOR PARTICIPATION

ARCOE-10 at ECAI-10

August 16-17, 2010
Lisbon, Portugal

The ECAI-10 Workshop on

Automated Reasoning about Context and Ontology Evolution (ARCOE-10)
http://www.arcoe.org/2010/

held on August 16-17, 2010

at the European Conference on Artificial Intelligence (ECAI-10)
http://ecai2010.appia.pt/

ARCOE-10 Highlights: We are pleased to announce that Prof. Tommie Meyer and Prof. Fausto Giunchiglia have agreed to give invited talks at ARCOE-10.


-- Description of the workshop --

Methods of automated reasoning have solved a large number of problems in Computer Science by using formal ontologies expressed in logic. Over the years, though, each problem or class of problems has required a different ontology, and sometimes a different version of logic. Moreover, the processes of conceiving, controlling and maintaining an ontology and its versions have turned out to be inherently complex. All this has motivated much investigation in a wide range of disparate disciplines -- from logic-based Knowledge Representation and Reasoning to Software Engineering, from Databases to Multimedia -- about how to relate ontologies to one another.

ARCOE-10 aims at bringing together researchers and practitioners from core areas of Artificial Intelligence (Knowledge Representation and Reasoning, Contexts, and Ontologies) to discuss these kinds of problems and relevant results. Historically, there have been at least three different, yet interdependent motivations behind this type of research: defining the relationship between an ontology and its context, providing support to ontology engineers, enhancing problem solving and communication for software agents.

Ontology and Context. Most application areas have recognised the need for representing and reasoning about knowledge that is distributed over many resources. Such knowledge depends on its context, i.e., on the syntactic and/or semantic structure of such resources. Research on information integration, distributed knowledge management, the semantic web, multi-agent and distributed reasoning have pinned down different aspects of how ontologies relate to and/or develop within their context.

Ontology Engineering. Ontology engineers are not supposed to succeed right from the beginning when (individually or collaboratively) developing an ontology. Despite their expertise and any assistance from domain experts, revision cycles are the rule. Research on the automation of the process of engineering an ontology has improved efficiency and reduced the introduction of unintended meanings by means of interactive ontology editors. Moreover, ontology matching has studied the process of manual, off-line alignment of two or more known ontologies.

Problem Solving and Communication for Agents. Agents that communicate with one another without having full access to their respective ontologies or that are programmed to face new non-classifiable situations must change their own ontology dynamically at run-time -- they cannot rely on human intervention. Research on this problem has either concentrated on non-monotonic reasoning and belief revision or on changes of signature, i.e., of the grammar of the ontology's language, with a minimal disruption to the original theory.

ARCOE-10 will provide a multi-disciplinary forum, where differences in methodologies, representation languages and techniques are over-arched and hopefully overcome. Accordingly, the workshop will be structured into four tracks: three of them will focus on specific areas, the fourth one will foster links and integration.

Track 1: Context and Ontology
This track will select and present works about Context and Ontology, a well-established research area that has mainly concentrated on the relationship between contexts and ontologies for distributed information and for the enhancement of software agents.

Track 2: Common Sense and Non-Monotonic Reasoning for Ontologies
This track will select and present works about logic-based Knowledge Representation and Reasoning, a classic area of AI, which since its origins has produced remarkable results on logic-based methods for supporting knowledge engineers and for enhancing software agents.

Track 3: Automated Ontology Evolution
This track will select and present works about Automated Ontology Evolution, an area which in recent years has been drawing the attention of Artificial Intelligence and Knowledge Representation and Reasoning on the automation of ontology evolution.

Track 4: Links and integration
This track will foster links and integration by means of invited talks and (panel) discussions. Topics that are likely to be covered are: the formalisation of software engineering concepts for ontology development; the relationship between automated reasoning and information retrieval; relationships between representation languages; relationships between canonical domains; relationships between contexts and ontology evolution and between Non-Monotonic Reasoning and ontology evolution.

ARCOE-10 will bring the participants to position the various approaches with respect to one another. Hopefully, though, the workshop will also start a process of cross-pollination and set out the constitution of a truly interdisciplinary research-community dedicated to automated reasoning about contexts and ontology evolution.


-- Topics --

Track 1: Context and Ontology
Submissions are welcome on the role of context and ontology in areas that include but are not limited to the following ones:

- Information Integration
- The role of context and ontology in Distributed Reasoning and Knowledge Management
- The role of context and ontology in Semantic Web
- Multi-Agent Systems
- Data Grid and Grid Computing
- Pervasive Computing and Ambient Intelligence
- Peer-to-peer Information Systems
- Comparison of uses of contexts and ontologies

Track 2: Common Sense and Non-Monotonic Reasoning
Submissions are welcome on the role of common sense and non-monotonic reasoning for ontologies in areas that include but are not limited to the following ones:

- Ontology Debugging, Update and Merging
- Inconsistency Handling, Belief Revision and Theory Change for DL ontologies
- Uncertainty Handling, Defeasible Reasoning and Argumentation in ontologies
- Heuristic and Approximate Reasoning
- Planning and Reasoning about Action and Change on the Semantic Web
- Rules and Ontologies
- Temporal and Spatial Reasoning

Track 3: Automated Ontology Evolution
Submissions are welcome on the role of automated ontology evolution in areas that include but are not limited to the following ones:

- Ontology fault diagnosis and repair
- Problem Solving
- Agent Communication
- Persistent Agents in Changing Environment
- Multimedia on the Web
- IT and Automated Reasoning


-- Attendance --

Authors will be selected on significance of their submission and will be preferred to simple attendees. Attendees will be selected on a first-come-first-served basis. Please check http://ecai2010.appia.pt/ for registration procedure and fees.


-- Submission Requirements and Dates --

ARCOE-10 will accept submissions of long abstracts, for both long presentations and poster presentations. The distinction during the selection-phase will be based on the significance and the quality of submissions as well as oriented towards fostering cross-pollination and discussions during the event. All selected abstracts will be included in the Working Notes. Authors are kindly requested to provide keywords upon submission. The format for submissions is the same as that of ECAI-10. Please check http://ecai2010.appia.pt/ for the style files. Submissions should be no longer than 2 pages and in PDF format. The possibility is being considered of publishing extended versions of the best works from the workshop in a special issue of a peer-reviewed journal.

Abstract submission: May 7, 2010
Notification: June 7, 2010
Camera ready: June 21, 2010
Early registration: T.B.A.
Late registration: T.B.A.
Workshop: August 16-17, 2010


-- Submit to --

Please submit to https://www.easychair.org/login.cgi?conf=arcoe10


-- Workshop Co-Chairs --

Alan Bundy
School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB, UK.
Tel: +44-131-650-2716, Fax No.: +44-131-650-6899

Jos Lehmann (primary contact)
School of Informatics, University of Edinburgh, Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB, UK.
Tel: +44-131-650-2725, Fax No.: +44-131-650-6899

Guilin Qi
School of Computer Science and Engineering, Southeast University, 211189, Jiangning District, Nanjing, China.
Fax: +86-25-52090880

Ivan José Varzinczak
Meraka Institute, Meiring Naude Road, CSIR, 0001 Pretoria, South Africa.
Tel: +27-12-841-25-94


-- Program Committee --

- Grigoris Antoniou (FORTH, Greece)
- Franz Baader (TU Dresden, Germany)
- Richard Booth (University of Luxembourg and Mahasarakham University, Thailand)
- Paolo Bouquet (University of Trento, Italy)
- Jerome Euzenat (INRIA Grenoble Rhone-Alpes, France)
- Giorgos Flouris (FORTH, Greece)
- Chiara Ghidini (FBK Fondazione Bruno Kessler, Italy)
- Deborah McGuinness (Rensselaer Polytechnic Institute, USA)
- Thomas Meyer (Meraka Institute, South Africa)
- Maurice Pagnucco (The University of New South Wales, Australia)
- Valeria de Paiva (Cuil Inc., USA)
- Jeff Pan (University of Aberdeen, UK)
- Dimitris Plexousakis FORTH, Greece)
- Luciano Serafini (FBK Fondazione Bruno Kessler, Italy)
- Renata Wassermann (Universidade de Sao Paulo, Brazil)


--
Ivan José Varzinczak - http://ksg.meraka.org.za/~ivarzinczak
Knowledge Systems Group, Meraka Institute - Pretoria, South Africa

Site Pessoal

Dica para html

http://www.projetistadigital.com/tag/subir-nivel-em-diretorios-e-pastas/

Linkando arquivos

Site Pessoal

Usando o compilador gcc

Publicado por Fabio Machado de Oliveira em 03/10/2007 em http://www.vivaolinux.com.br/dica/Usando-o-compilador-gcc

O Linux foi escrito na linguagem C e a maioria de seus aplicativos também são escritos nessa poderosa linguagem de programação.

Segundo o estigma que ronda o Linux, seus usuários também são programadores e para poder criar um programa em C para executar no Linux, dois passos tem que ser seguidos:

1. Escrever o código fonte em um editor de texto qualquer (O vi e o mais usado) e salvar com a extensão .c.

2. Compilar o arquivo nome_do_arquivo.c com um compilador para a linguagem c (O gcc é o mais usado e tido como padrão para o Linux).

A principal forma de compilar é gerar um executável diretamente:

$ gcc nome_do_arquivo.c -o nome_do_programa_executável

O argumento -o linka o objeto gerado para um executável com o nome desejado pelo programador.

Para executar o programa, verifique sua permissão e execute de seguinte maneira:

$ ./nome_do_programa_executável

O argumento -O otimiza o código fonte e o executável, gerando uma saída padrão (a.out):

$ gcc -O nome_do_arquivo.c

Para saber mais sobre o compilador e suas formas de uso:

$ man gcc

O gcc foi escrito por Richard Stallman, fundador do projeto GNU e da Free Foundation Software na década de 60 e continua em constante desenvolvimento e evolução.

Para mais informações sobre o Linux visite o seguinte site: http://www.vivaolinux.com.br/

Site Pessoal

Máquinas de Turing

...

Por Samir Gorsky




"Turing Centenary Advisory Committee" do "The Alan Turing Year A
Centenary Celebration of the Life and Work of Alan Turing":

http://www.mathcomp.leeds.ac.uk/turing2012/

Conforme convite/sugestão do Advisory Committee, há proposta
de uma sessão sobre Alan Turing no XVI Encontro Brasileiro de Lógica
que será organizado em 2011. A referida sessão atuaria como preparação
ao centenário do nascimento de Alan Turing em 2012.

Site Pessoal

Truque combinatorial com cartas

.

por Samir Gorsky

O truque com as cartas envolve um esquema combinatório sim, vou simplificar um pouco para ficar mais fácil para eu explicar. pense o seguinte:

1 4 7
2 5 8
3 6 9

os números representam as cartas...com variações vc pode fazer a mágica com números diferentes de cartas (o truque original e com 7 cartas)

escolhe-se uma carta ao acaso...por exemplo 3

recolhe-se as cartas da seguinte maneira:

a a carta de baixo fica em cima da pilha formada pela coluna a que ela pertence

exemplo

3 2 1

e a pilha da carta escolhida fica no meio das duas outras em resumo, vc recolhe as cartas de modo que a ordem (quando as cartas estão com a face virada para ti) é:

6 4 5 3 2 1 9 8 7

distribui-se novamente as cartas da seguinte maneira

6 4 5
3 2 1
9 8 7

ou

poder-se-ia ter a seguinte configuração

9 8 7 3 2 1 6 5 4

e a distribuição seria

9 8 7
3 2 1
6 5 4

percebe-se que o 3 continua na mesma posição...

recolhe-se as cartas da mesma forma que foi feito na primeira etapa

a ordem será então (a outra possibilidade levará ao mesmo resultado esperado e relevante):

5 2 8 6 3 9 7 1 4

distribuindo as cartas da mesma forma que na etapa anterior:

5 2 8
6 3 9
7 1 4

depois recolhe-se as cartas com a face virada para baixo e a coluna da carta escolhida 3 entre as outras duas.

nesta mágica sempre deve-se perguntar em qual coluna a carta escolhida está

a ordem das cartas (viradas com a face para baixo) será:

8 9 4 2 3 1 5 6 7

tira-se a ultima carta do baralho (7) se voce dispor as cartas restantes em dois grupos de 4 poderia fazer da seguinte forma com a face para baixo (neste ponto sabe-se que a carta escolhida é a quinta pois os processos anteriores sempre deixam esta carta no meio da coluna do meio.

a) 8 9 4 2 b) 3 1 5 6

pede-se para se escolher um dos montes se a escolha for por exemplo

a)

então retira-se este

pede-se para se escolher duas cartas

(voce sabe que a primeira carta do monte é a esperada)

portanto retire as duas cartas que não possuem a carta esperada

exemplo: se foi escolhido 6 5 retire elas

se for escolhido 3 e 5 retire 1 e 6 (não explique muito para que não percebam que vc está retirando as cartas conforme a sua escolha)

repetindo-se a questão vc chega na carta escolhida.

Site Pessoal
 
Blogger Templates